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-EXP.epf -i ../../../trunk/examples/svcomp/loop-invgen/seq_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 10:37:04,940 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 10:37:04,946 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 10:37:04,964 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 10:37:04,965 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 10:37:04,966 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 10:37:04,967 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 10:37:04,969 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 10:37:04,971 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 10:37:04,972 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 10:37:04,972 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 10:37:04,973 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 10:37:04,974 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 10:37:04,975 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 10:37:04,976 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 10:37:04,977 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 10:37:04,983 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 10:37:04,988 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 10:37:04,992 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 10:37:04,993 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 10:37:04,994 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 10:37:04,999 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 10:37:05,003 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 10:37:05,003 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 10:37:05,004 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 10:37:05,005 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 10:37:05,005 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 10:37:05,008 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 10:37:05,008 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 10:37:05,010 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 10:37:05,010 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 10:37:05,013 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 10:37:05,013 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 10:37:05,013 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 10:37:05,016 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 10:37:05,016 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 10:37:05,017 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-11-07 10:37:05,040 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 10:37:05,040 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 10:37:05,042 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 10:37:05,042 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 10:37:05,042 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 10:37:05,042 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 10:37:05,042 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-07 10:37:05,043 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 10:37:05,043 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 10:37:05,043 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 10:37:05,044 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 10:37:05,044 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 10:37:05,044 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 10:37:05,044 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 10:37:05,045 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 10:37:05,045 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 10:37:05,045 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 10:37:05,046 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 10:37:05,046 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 10:37:05,046 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 10:37:05,046 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 10:37:05,046 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 10:37:05,047 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 10:37:05,047 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 10:37:05,047 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 10:37:05,047 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 10:37:05,047 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 10:37:05,049 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 10:37:05,050 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 10:37:05,050 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 10:37:05,050 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 10:37:05,050 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 10:37:05,050 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 10:37:05,051 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 10:37:05,051 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 10:37:05,051 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 10:37:05,115 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 10:37:05,132 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 10:37:05,137 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 10:37:05,139 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 10:37:05,139 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 10:37:05,140 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/seq_true-unreach-call_true-termination.i [2018-11-07 10:37:05,195 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3ca95c33/6f2a94d1e73e4382bd729acf445ffafe/FLAGcb19a4e33 [2018-11-07 10:37:05,600 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 10:37:05,600 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/seq_true-unreach-call_true-termination.i [2018-11-07 10:37:05,606 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3ca95c33/6f2a94d1e73e4382bd729acf445ffafe/FLAGcb19a4e33 [2018-11-07 10:37:05,620 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3ca95c33/6f2a94d1e73e4382bd729acf445ffafe [2018-11-07 10:37:05,631 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 10:37:05,632 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 10:37:05,633 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 10:37:05,633 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 10:37:05,636 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 10:37:05,637 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:37:05" (1/1) ... [2018-11-07 10:37:05,640 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55667916 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:37:05, skipping insertion in model container [2018-11-07 10:37:05,641 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:37:05" (1/1) ... [2018-11-07 10:37:05,651 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 10:37:05,674 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 10:37:05,913 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 10:37:05,918 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 10:37:05,936 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 10:37:05,948 INFO L193 MainTranslator]: Completed translation [2018-11-07 10:37:05,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:37:05 WrapperNode [2018-11-07 10:37:05,949 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 10:37:05,950 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 10:37:05,950 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 10:37:05,950 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 10:37:05,959 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:37:05" (1/1) ... [2018-11-07 10:37:05,965 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:37:05" (1/1) ... [2018-11-07 10:37:05,971 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 10:37:05,972 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 10:37:05,972 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 10:37:05,972 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 10:37:05,982 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:37:05" (1/1) ... [2018-11-07 10:37:05,982 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:37:05" (1/1) ... [2018-11-07 10:37:05,983 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:37:05" (1/1) ... [2018-11-07 10:37:05,983 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:37:05" (1/1) ... [2018-11-07 10:37:05,987 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:37:05" (1/1) ... [2018-11-07 10:37:05,992 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:37:05" (1/1) ... [2018-11-07 10:37:05,993 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:37:05" (1/1) ... [2018-11-07 10:37:05,995 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 10:37:05,995 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 10:37:05,996 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 10:37:05,996 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 10:37:05,997 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:37:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 10:37:06,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 10:37:06,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 10:37:06,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 10:37:06,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 10:37:06,122 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 10:37:06,122 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 10:37:06,123 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 10:37:06,123 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 10:37:06,472 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 10:37:06,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:37:06 BoogieIcfgContainer [2018-11-07 10:37:06,473 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 10:37:06,474 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 10:37:06,474 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 10:37:06,477 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 10:37:06,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:37:05" (1/3) ... [2018-11-07 10:37:06,479 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5458e568 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:37:06, skipping insertion in model container [2018-11-07 10:37:06,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:37:05" (2/3) ... [2018-11-07 10:37:06,479 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5458e568 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:37:06, skipping insertion in model container [2018-11-07 10:37:06,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:37:06" (3/3) ... [2018-11-07 10:37:06,481 INFO L112 eAbstractionObserver]: Analyzing ICFG seq_true-unreach-call_true-termination.i [2018-11-07 10:37:06,497 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 10:37:06,509 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 10:37:06,528 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 10:37:06,560 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 10:37:06,560 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 10:37:06,561 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 10:37:06,561 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 10:37:06,561 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 10:37:06,561 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 10:37:06,561 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 10:37:06,562 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 10:37:06,581 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2018-11-07 10:37:06,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-07 10:37:06,587 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:06,588 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:06,590 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:06,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:06,595 INFO L82 PathProgramCache]: Analyzing trace with hash 301890663, now seen corresponding path program 1 times [2018-11-07 10:37:06,598 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:06,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:06,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:37:06,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:06,643 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:06,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:06,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:37:06,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:37:06,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 10:37:06,713 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:37:06,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 10:37:06,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 10:37:06,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 10:37:06,732 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2018-11-07 10:37:06,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:06,754 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2018-11-07 10:37:06,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 10:37:06,756 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-07 10:37:06,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:06,765 INFO L225 Difference]: With dead ends: 45 [2018-11-07 10:37:06,766 INFO L226 Difference]: Without dead ends: 23 [2018-11-07 10:37:06,769 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 10:37:06,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-07 10:37:06,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-07 10:37:06,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-07 10:37:06,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-11-07 10:37:06,804 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 17 [2018-11-07 10:37:06,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:06,805 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-11-07 10:37:06,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 10:37:06,805 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-11-07 10:37:06,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-07 10:37:06,806 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:06,806 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:06,807 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:06,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:06,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1130037681, now seen corresponding path program 1 times [2018-11-07 10:37:06,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:06,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:06,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:37:06,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:06,809 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:06,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:07,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:37:07,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:37:07,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-07 10:37:07,002 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:37:07,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 10:37:07,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 10:37:07,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-07 10:37:07,005 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 7 states. [2018-11-07 10:37:07,443 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-11-07 10:37:07,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:07,519 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2018-11-07 10:37:07,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 10:37:07,521 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-11-07 10:37:07,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:07,524 INFO L225 Difference]: With dead ends: 48 [2018-11-07 10:37:07,524 INFO L226 Difference]: Without dead ends: 35 [2018-11-07 10:37:07,525 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-11-07 10:37:07,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-07 10:37:07,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2018-11-07 10:37:07,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-07 10:37:07,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-11-07 10:37:07,541 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 19 [2018-11-07 10:37:07,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:07,542 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-11-07 10:37:07,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 10:37:07,542 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-11-07 10:37:07,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-07 10:37:07,545 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:07,545 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:07,545 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:07,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:07,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1499928661, now seen corresponding path program 1 times [2018-11-07 10:37:07,546 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:07,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:07,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:37:07,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:07,550 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:07,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:07,646 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:37:07,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:37:07,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 10:37:07,648 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:37:07,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 10:37:07,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 10:37:07,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-07 10:37:07,650 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 6 states. [2018-11-07 10:37:07,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:07,768 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2018-11-07 10:37:07,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 10:37:07,768 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-07 10:37:07,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:07,770 INFO L225 Difference]: With dead ends: 42 [2018-11-07 10:37:07,770 INFO L226 Difference]: Without dead ends: 40 [2018-11-07 10:37:07,771 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-07 10:37:07,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-07 10:37:07,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2018-11-07 10:37:07,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-07 10:37:07,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2018-11-07 10:37:07,782 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 21 [2018-11-07 10:37:07,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:07,782 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2018-11-07 10:37:07,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 10:37:07,783 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-11-07 10:37:07,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-07 10:37:07,784 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:07,784 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:07,786 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:07,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:07,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1355895601, now seen corresponding path program 1 times [2018-11-07 10:37:07,787 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:07,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:07,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:37:07,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:07,788 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:07,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:08,063 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:37:08,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:08,063 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:37:08,065 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-11-07 10:37:08,067 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [16], [20], [26], [30], [34], [36], [40], [44], [50], [52], [57], [60], [62], [65], [67], [68], [69], [70], [72], [73] [2018-11-07 10:37:08,108 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 10:37:08,108 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 10:37:08,484 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 10:37:08,486 INFO L272 AbstractInterpreter]: Visited 24 different actions 72 times. Merged at 8 different actions 22 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 12 variables. [2018-11-07 10:37:08,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:08,500 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 10:37:08,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:08,500 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:37:08,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:37:08,510 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:37:08,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:08,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:37:08,979 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:37:08,979 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:37:09,255 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:37:09,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:37:09,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2018-11-07 10:37:09,285 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:37:09,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 10:37:09,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 10:37:09,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-11-07 10:37:09,288 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 14 states. [2018-11-07 10:37:09,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:09,609 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2018-11-07 10:37:09,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 10:37:09,609 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 29 [2018-11-07 10:37:09,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:09,614 INFO L225 Difference]: With dead ends: 64 [2018-11-07 10:37:09,614 INFO L226 Difference]: Without dead ends: 47 [2018-11-07 10:37:09,615 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 48 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2018-11-07 10:37:09,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-07 10:37:09,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 37. [2018-11-07 10:37:09,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-07 10:37:09,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2018-11-07 10:37:09,623 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 29 [2018-11-07 10:37:09,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:09,624 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2018-11-07 10:37:09,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 10:37:09,624 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-11-07 10:37:09,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-07 10:37:09,625 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:09,625 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:09,626 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:09,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:09,626 INFO L82 PathProgramCache]: Analyzing trace with hash 95654235, now seen corresponding path program 1 times [2018-11-07 10:37:09,626 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:09,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:09,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:37:09,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:09,628 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:09,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:09,782 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:37:09,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:09,783 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:37:09,783 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-11-07 10:37:09,783 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [16], [20], [22], [26], [30], [34], [40], [44], [50], [52], [57], [60], [62], [65], [67], [68], [69], [70], [72], [73] [2018-11-07 10:37:09,785 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 10:37:09,785 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 10:37:09,855 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 10:37:09,856 INFO L272 AbstractInterpreter]: Visited 24 different actions 78 times. Merged at 11 different actions 28 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 12 variables. [2018-11-07 10:37:09,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:09,872 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 10:37:09,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:09,872 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:37:09,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:37:09,883 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:37:09,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:09,911 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:37:10,059 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:37:10,060 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:37:10,138 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:37:10,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:37:10,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2018-11-07 10:37:10,167 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:37:10,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-07 10:37:10,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-07 10:37:10,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-11-07 10:37:10,169 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 13 states. [2018-11-07 10:37:10,679 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-07 10:37:10,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:10,717 INFO L93 Difference]: Finished difference Result 79 states and 91 transitions. [2018-11-07 10:37:10,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-07 10:37:10,718 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 29 [2018-11-07 10:37:10,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:10,719 INFO L225 Difference]: With dead ends: 79 [2018-11-07 10:37:10,719 INFO L226 Difference]: Without dead ends: 62 [2018-11-07 10:37:10,720 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 49 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2018-11-07 10:37:10,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-07 10:37:10,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 40. [2018-11-07 10:37:10,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-07 10:37:10,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-11-07 10:37:10,730 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 29 [2018-11-07 10:37:10,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:10,730 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-11-07 10:37:10,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-07 10:37:10,731 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-07 10:37:10,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-07 10:37:10,732 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:10,732 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:10,732 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:10,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:10,733 INFO L82 PathProgramCache]: Analyzing trace with hash -446111159, now seen corresponding path program 2 times [2018-11-07 10:37:10,733 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:10,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:10,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:37:10,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:10,734 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:10,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:10,827 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:37:10,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:10,828 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:37:10,828 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:37:10,828 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:37:10,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:10,828 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:37:10,839 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:37:10,839 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:37:10,869 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 10:37:10,869 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:37:10,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:37:10,905 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:37:10,905 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:37:10,957 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:37:10,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:37:10,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 10 [2018-11-07 10:37:10,977 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:37:10,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 10:37:10,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 10:37:10,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-11-07 10:37:10,979 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 10 states. [2018-11-07 10:37:11,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:11,115 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-11-07 10:37:11,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 10:37:11,115 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-11-07 10:37:11,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:11,117 INFO L225 Difference]: With dead ends: 50 [2018-11-07 10:37:11,117 INFO L226 Difference]: Without dead ends: 48 [2018-11-07 10:37:11,118 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 59 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-11-07 10:37:11,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-07 10:37:11,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-07 10:37:11,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-07 10:37:11,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2018-11-07 10:37:11,126 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 31 [2018-11-07 10:37:11,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:11,127 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2018-11-07 10:37:11,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 10:37:11,127 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2018-11-07 10:37:11,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-07 10:37:11,128 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:11,128 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:11,129 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:11,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:11,129 INFO L82 PathProgramCache]: Analyzing trace with hash 94447981, now seen corresponding path program 3 times [2018-11-07 10:37:11,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:11,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:11,130 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:37:11,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:11,130 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:11,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:11,271 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 10:37:11,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:11,271 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:37:11,271 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:37:11,272 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:37:11,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:11,272 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:37:11,282 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:37:11,282 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:37:11,326 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:37:11,326 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:37:11,330 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:37:11,613 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 10:37:11,613 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:37:11,727 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 10:37:11,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:37:11,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 18 [2018-11-07 10:37:11,747 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:37:11,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 10:37:11,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 10:37:11,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2018-11-07 10:37:11,750 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 18 states. [2018-11-07 10:37:12,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:12,169 INFO L93 Difference]: Finished difference Result 87 states and 98 transitions. [2018-11-07 10:37:12,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-07 10:37:12,170 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 39 [2018-11-07 10:37:12,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:12,172 INFO L225 Difference]: With dead ends: 87 [2018-11-07 10:37:12,172 INFO L226 Difference]: Without dead ends: 66 [2018-11-07 10:37:12,173 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 64 SyntacticMatches, 8 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=163, Invalid=487, Unknown=0, NotChecked=0, Total=650 [2018-11-07 10:37:12,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-07 10:37:12,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 50. [2018-11-07 10:37:12,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-07 10:37:12,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-11-07 10:37:12,182 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 39 [2018-11-07 10:37:12,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:12,183 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-11-07 10:37:12,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 10:37:12,183 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-11-07 10:37:12,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-07 10:37:12,184 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:12,185 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:12,185 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:12,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:12,185 INFO L82 PathProgramCache]: Analyzing trace with hash 594202361, now seen corresponding path program 1 times [2018-11-07 10:37:12,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:12,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:12,186 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:37:12,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:12,187 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:12,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:12,305 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 10:37:12,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:12,306 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:37:12,306 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 40 with the following transitions: [2018-11-07 10:37:12,306 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [16], [20], [22], [26], [30], [34], [36], [40], [44], [50], [52], [57], [60], [62], [65], [67], [68], [69], [70], [72], [73] [2018-11-07 10:37:12,308 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 10:37:12,309 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 10:37:12,423 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 10:37:12,423 INFO L272 AbstractInterpreter]: Visited 25 different actions 95 times. Merged at 12 different actions 35 times. Widened at 1 different actions 1 times. Found 8 fixpoints after 4 different actions. Largest state had 14 variables. [2018-11-07 10:37:12,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:12,475 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 10:37:12,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:12,475 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:37:12,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:37:12,490 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:37:12,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:12,515 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:37:12,729 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 10:37:12,730 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:37:12,866 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 10:37:12,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:37:12,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2018-11-07 10:37:12,887 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:37:12,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-07 10:37:12,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-07 10:37:12,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2018-11-07 10:37:12,888 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 17 states. [2018-11-07 10:37:13,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:13,308 INFO L93 Difference]: Finished difference Result 103 states and 118 transitions. [2018-11-07 10:37:13,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-07 10:37:13,308 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 39 [2018-11-07 10:37:13,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:13,310 INFO L225 Difference]: With dead ends: 103 [2018-11-07 10:37:13,310 INFO L226 Difference]: Without dead ends: 82 [2018-11-07 10:37:13,311 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 65 SyntacticMatches, 8 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=171, Invalid=531, Unknown=0, NotChecked=0, Total=702 [2018-11-07 10:37:13,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-07 10:37:13,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 50. [2018-11-07 10:37:13,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-07 10:37:13,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-11-07 10:37:13,322 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 39 [2018-11-07 10:37:13,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:13,322 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-11-07 10:37:13,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-07 10:37:13,322 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-11-07 10:37:13,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-07 10:37:13,323 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:13,324 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:13,324 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:13,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:13,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1103599739, now seen corresponding path program 2 times [2018-11-07 10:37:13,324 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:13,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:13,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:37:13,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:13,326 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:13,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:13,433 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 10:37:13,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:13,433 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:37:13,434 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:37:13,434 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:37:13,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:13,434 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:37:13,443 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:37:13,443 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:37:13,470 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 10:37:13,471 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:37:13,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:37:13,912 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 10:37:13,913 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:37:14,081 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 10:37:14,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:37:14,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 16 [2018-11-07 10:37:14,101 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:37:14,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-07 10:37:14,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-07 10:37:14,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2018-11-07 10:37:14,102 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 16 states. [2018-11-07 10:37:14,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:14,418 INFO L93 Difference]: Finished difference Result 122 states and 142 transitions. [2018-11-07 10:37:14,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-07 10:37:14,419 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 39 [2018-11-07 10:37:14,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:14,421 INFO L225 Difference]: With dead ends: 122 [2018-11-07 10:37:14,421 INFO L226 Difference]: Without dead ends: 101 [2018-11-07 10:37:14,422 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 66 SyntacticMatches, 8 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=163, Invalid=487, Unknown=0, NotChecked=0, Total=650 [2018-11-07 10:37:14,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-07 10:37:14,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 53. [2018-11-07 10:37:14,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-07 10:37:14,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2018-11-07 10:37:14,434 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 39 [2018-11-07 10:37:14,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:14,435 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2018-11-07 10:37:14,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-07 10:37:14,435 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2018-11-07 10:37:14,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-07 10:37:14,436 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:14,436 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:14,436 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:14,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:14,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1990570393, now seen corresponding path program 4 times [2018-11-07 10:37:14,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:14,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:14,438 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:37:14,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:14,438 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:14,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:14,531 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 15 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-07 10:37:14,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:14,532 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:37:14,532 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:37:14,532 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:37:14,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:14,532 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:37:14,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:37:14,541 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:37:14,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:14,559 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:37:14,593 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 10:37:14,593 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:37:14,693 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 10:37:14,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:37:14,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 11 [2018-11-07 10:37:14,714 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:37:14,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 10:37:14,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 10:37:14,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-07 10:37:14,715 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand 11 states. [2018-11-07 10:37:15,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:15,081 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2018-11-07 10:37:15,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-07 10:37:15,081 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2018-11-07 10:37:15,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:15,083 INFO L225 Difference]: With dead ends: 63 [2018-11-07 10:37:15,083 INFO L226 Difference]: Without dead ends: 61 [2018-11-07 10:37:15,084 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 78 SyntacticMatches, 7 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-11-07 10:37:15,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-07 10:37:15,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-11-07 10:37:15,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-07 10:37:15,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2018-11-07 10:37:15,094 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 41 [2018-11-07 10:37:15,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:15,094 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2018-11-07 10:37:15,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 10:37:15,094 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2018-11-07 10:37:15,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-07 10:37:15,095 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:15,095 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:15,096 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:15,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:15,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1735104395, now seen corresponding path program 5 times [2018-11-07 10:37:15,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:15,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:15,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:37:15,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:15,098 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:15,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:15,470 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 27 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-07 10:37:15,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:15,470 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:37:15,470 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:37:15,470 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:37:15,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:15,471 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:37:15,486 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:37:15,487 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:37:15,506 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-07 10:37:15,506 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:37:15,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:37:15,711 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 27 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-07 10:37:15,711 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:37:15,818 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 27 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-07 10:37:15,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:37:15,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 22 [2018-11-07 10:37:15,838 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:37:15,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-07 10:37:15,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-07 10:37:15,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=359, Unknown=0, NotChecked=0, Total=462 [2018-11-07 10:37:15,840 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand 22 states. [2018-11-07 10:37:16,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:16,269 INFO L93 Difference]: Finished difference Result 110 states and 124 transitions. [2018-11-07 10:37:16,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 10:37:16,275 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 49 [2018-11-07 10:37:16,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:16,276 INFO L225 Difference]: With dead ends: 110 [2018-11-07 10:37:16,277 INFO L226 Difference]: Without dead ends: 85 [2018-11-07 10:37:16,278 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 80 SyntacticMatches, 10 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=233, Invalid=759, Unknown=0, NotChecked=0, Total=992 [2018-11-07 10:37:16,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-07 10:37:16,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 63. [2018-11-07 10:37:16,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-07 10:37:16,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2018-11-07 10:37:16,295 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 49 [2018-11-07 10:37:16,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:16,295 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2018-11-07 10:37:16,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-07 10:37:16,295 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2018-11-07 10:37:16,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-07 10:37:16,300 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:16,300 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:16,300 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:16,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:16,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1916583447, now seen corresponding path program 2 times [2018-11-07 10:37:16,303 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:16,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:16,304 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:37:16,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:16,304 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:16,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:16,536 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 27 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-07 10:37:16,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:16,536 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:37:16,537 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:37:16,537 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:37:16,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:16,537 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:37:16,545 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:37:16,545 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:37:16,615 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-07 10:37:16,615 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:37:16,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:37:16,916 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 27 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-07 10:37:16,916 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:37:17,113 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 27 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-07 10:37:17,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:37:17,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 21 [2018-11-07 10:37:17,134 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:37:17,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-07 10:37:17,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-07 10:37:17,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2018-11-07 10:37:17,135 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand 21 states. [2018-11-07 10:37:17,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:17,563 INFO L93 Difference]: Finished difference Result 132 states and 151 transitions. [2018-11-07 10:37:17,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 10:37:17,564 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 49 [2018-11-07 10:37:17,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:17,565 INFO L225 Difference]: With dead ends: 132 [2018-11-07 10:37:17,565 INFO L226 Difference]: Without dead ends: 107 [2018-11-07 10:37:17,567 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 81 SyntacticMatches, 10 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=253, Invalid=869, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 10:37:17,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-11-07 10:37:17,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 63. [2018-11-07 10:37:17,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-07 10:37:17,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2018-11-07 10:37:17,588 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 49 [2018-11-07 10:37:17,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:17,588 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2018-11-07 10:37:17,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-07 10:37:17,588 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2018-11-07 10:37:17,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-07 10:37:17,589 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:17,589 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:17,590 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:17,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:17,595 INFO L82 PathProgramCache]: Analyzing trace with hash -402778205, now seen corresponding path program 3 times [2018-11-07 10:37:17,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:17,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:17,596 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:37:17,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:17,597 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:17,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:17,846 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 27 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-07 10:37:17,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:17,847 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:37:17,847 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:37:17,847 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:37:17,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:17,847 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:37:17,857 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:37:17,857 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:37:17,884 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:37:17,885 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:37:17,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:37:18,262 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 27 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-07 10:37:18,262 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:37:18,320 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 27 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-07 10:37:18,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:37:18,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2018-11-07 10:37:18,342 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:37:18,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-07 10:37:18,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-07 10:37:18,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2018-11-07 10:37:18,343 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand 20 states. [2018-11-07 10:37:18,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:18,679 INFO L93 Difference]: Finished difference Result 152 states and 176 transitions. [2018-11-07 10:37:18,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-07 10:37:18,686 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 49 [2018-11-07 10:37:18,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:18,688 INFO L225 Difference]: With dead ends: 152 [2018-11-07 10:37:18,688 INFO L226 Difference]: Without dead ends: 127 [2018-11-07 10:37:18,689 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 82 SyntacticMatches, 10 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=253, Invalid=869, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 10:37:18,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-11-07 10:37:18,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 63. [2018-11-07 10:37:18,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-07 10:37:18,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2018-11-07 10:37:18,702 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 49 [2018-11-07 10:37:18,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:18,703 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2018-11-07 10:37:18,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-07 10:37:18,703 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2018-11-07 10:37:18,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-07 10:37:18,704 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:18,704 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:18,704 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:18,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:18,704 INFO L82 PathProgramCache]: Analyzing trace with hash 488662063, now seen corresponding path program 3 times [2018-11-07 10:37:18,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:18,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:18,705 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:37:18,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:18,706 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:18,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:18,866 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 27 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-07 10:37:18,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:18,866 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:37:18,866 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:37:18,867 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:37:18,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:18,867 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:37:18,877 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:37:18,878 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:37:18,894 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:37:18,895 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:37:18,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:37:19,065 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 27 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-07 10:37:19,065 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:37:19,297 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 27 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-07 10:37:19,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:37:19,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 19 [2018-11-07 10:37:19,318 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:37:19,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-07 10:37:19,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-07 10:37:19,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2018-11-07 10:37:19,319 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand 19 states. [2018-11-07 10:37:19,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:19,776 INFO L93 Difference]: Finished difference Result 175 states and 205 transitions. [2018-11-07 10:37:19,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-07 10:37:19,781 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 49 [2018-11-07 10:37:19,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:19,783 INFO L225 Difference]: With dead ends: 175 [2018-11-07 10:37:19,783 INFO L226 Difference]: Without dead ends: 150 [2018-11-07 10:37:19,784 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 83 SyntacticMatches, 10 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=233, Invalid=759, Unknown=0, NotChecked=0, Total=992 [2018-11-07 10:37:19,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-11-07 10:37:19,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 66. [2018-11-07 10:37:19,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-07 10:37:19,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2018-11-07 10:37:19,809 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 49 [2018-11-07 10:37:19,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:19,810 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2018-11-07 10:37:19,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-07 10:37:19,810 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2018-11-07 10:37:19,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-07 10:37:19,811 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:19,811 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:19,811 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:19,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:19,812 INFO L82 PathProgramCache]: Analyzing trace with hash -396473339, now seen corresponding path program 6 times [2018-11-07 10:37:19,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:19,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:19,815 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:37:19,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:19,816 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:19,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:20,656 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 25 proven. 28 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-07 10:37:20,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:20,656 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:37:20,656 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:37:20,656 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:37:20,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:20,656 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:37:20,665 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:37:20,665 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:37:20,679 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:37:20,679 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:37:20,681 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:37:20,704 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 26 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-07 10:37:20,704 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:37:20,792 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 26 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-07 10:37:20,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:37:20,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 12 [2018-11-07 10:37:20,813 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:37:20,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 10:37:20,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 10:37:20,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-11-07 10:37:20,814 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand 12 states. [2018-11-07 10:37:20,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:20,966 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2018-11-07 10:37:20,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-07 10:37:20,966 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 51 [2018-11-07 10:37:20,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:20,968 INFO L225 Difference]: With dead ends: 76 [2018-11-07 10:37:20,968 INFO L226 Difference]: Without dead ends: 74 [2018-11-07 10:37:20,969 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 97 SyntacticMatches, 9 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-11-07 10:37:20,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-07 10:37:20,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-11-07 10:37:20,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-07 10:37:20,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2018-11-07 10:37:20,982 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 51 [2018-11-07 10:37:20,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:20,982 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2018-11-07 10:37:20,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 10:37:20,982 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2018-11-07 10:37:20,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-07 10:37:20,983 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:20,983 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:20,984 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:20,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:20,984 INFO L82 PathProgramCache]: Analyzing trace with hash 928978729, now seen corresponding path program 7 times [2018-11-07 10:37:20,984 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:20,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:20,985 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:37:20,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:20,985 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:20,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:21,180 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 44 proven. 20 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-07 10:37:21,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:21,180 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:37:21,180 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:37:21,180 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:37:21,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:21,181 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:37:21,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:37:21,189 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:37:21,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:21,207 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:37:21,439 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 44 proven. 20 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-07 10:37:21,440 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:37:21,532 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 44 proven. 20 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-07 10:37:21,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:37:21,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 26 [2018-11-07 10:37:21,552 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:37:21,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-07 10:37:21,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-07 10:37:21,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2018-11-07 10:37:21,554 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand 26 states. [2018-11-07 10:37:21,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:21,878 INFO L93 Difference]: Finished difference Result 133 states and 150 transitions. [2018-11-07 10:37:21,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-07 10:37:21,879 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 59 [2018-11-07 10:37:21,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:21,880 INFO L225 Difference]: With dead ends: 133 [2018-11-07 10:37:21,880 INFO L226 Difference]: Without dead ends: 104 [2018-11-07 10:37:21,881 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 96 SyntacticMatches, 12 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=315, Invalid=1091, Unknown=0, NotChecked=0, Total=1406 [2018-11-07 10:37:21,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-07 10:37:21,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 76. [2018-11-07 10:37:21,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-07 10:37:21,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2018-11-07 10:37:21,895 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 59 [2018-11-07 10:37:21,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:21,895 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2018-11-07 10:37:21,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-07 10:37:21,896 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2018-11-07 10:37:21,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-07 10:37:21,896 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:21,896 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:21,897 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:21,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:21,897 INFO L82 PathProgramCache]: Analyzing trace with hash 277511861, now seen corresponding path program 4 times [2018-11-07 10:37:21,897 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:21,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:21,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:37:21,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:21,898 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:21,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:22,042 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 44 proven. 14 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-07 10:37:22,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:22,043 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:37:22,043 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:37:22,043 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:37:22,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:22,043 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:37:22,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:37:22,052 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:37:22,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:22,069 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:37:22,266 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 44 proven. 14 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-07 10:37:22,266 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:37:22,344 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 44 proven. 14 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-07 10:37:22,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:37:22,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 25 [2018-11-07 10:37:22,364 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:37:22,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-07 10:37:22,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-07 10:37:22,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=474, Unknown=0, NotChecked=0, Total=600 [2018-11-07 10:37:22,365 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 25 states. [2018-11-07 10:37:23,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:23,244 INFO L93 Difference]: Finished difference Result 161 states and 184 transitions. [2018-11-07 10:37:23,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-07 10:37:23,244 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 59 [2018-11-07 10:37:23,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:23,245 INFO L225 Difference]: With dead ends: 161 [2018-11-07 10:37:23,245 INFO L226 Difference]: Without dead ends: 132 [2018-11-07 10:37:23,246 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 97 SyntacticMatches, 12 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 570 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=351, Invalid=1289, Unknown=0, NotChecked=0, Total=1640 [2018-11-07 10:37:23,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-11-07 10:37:23,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 76. [2018-11-07 10:37:23,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-07 10:37:23,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2018-11-07 10:37:23,262 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 59 [2018-11-07 10:37:23,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:23,262 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2018-11-07 10:37:23,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-07 10:37:23,262 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2018-11-07 10:37:23,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-07 10:37:23,263 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:23,263 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:23,263 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:23,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:23,263 INFO L82 PathProgramCache]: Analyzing trace with hash -129869503, now seen corresponding path program 5 times [2018-11-07 10:37:23,264 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:23,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:23,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:37:23,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:23,265 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:23,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:23,479 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 44 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-07 10:37:23,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:23,480 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:37:23,480 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:37:23,480 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:37:23,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:23,480 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:37:23,488 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:37:23,488 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:37:23,505 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-07 10:37:23,505 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:37:23,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:37:23,662 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 44 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-07 10:37:23,662 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:37:23,732 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 44 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-07 10:37:23,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:37:23,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 24 [2018-11-07 10:37:23,754 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:37:23,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-07 10:37:23,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-07 10:37:23,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2018-11-07 10:37:23,755 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 24 states. [2018-11-07 10:37:24,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:24,191 INFO L93 Difference]: Finished difference Result 187 states and 216 transitions. [2018-11-07 10:37:24,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-07 10:37:24,191 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 59 [2018-11-07 10:37:24,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:24,193 INFO L225 Difference]: With dead ends: 187 [2018-11-07 10:37:24,193 INFO L226 Difference]: Without dead ends: 158 [2018-11-07 10:37:24,198 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 98 SyntacticMatches, 12 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 573 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=364, Invalid=1358, Unknown=0, NotChecked=0, Total=1722 [2018-11-07 10:37:24,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-11-07 10:37:24,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 76. [2018-11-07 10:37:24,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-07 10:37:24,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2018-11-07 10:37:24,219 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 59 [2018-11-07 10:37:24,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:24,219 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2018-11-07 10:37:24,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-07 10:37:24,220 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2018-11-07 10:37:24,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-07 10:37:24,220 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:24,221 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:24,221 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:24,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:24,221 INFO L82 PathProgramCache]: Analyzing trace with hash -49846579, now seen corresponding path program 6 times [2018-11-07 10:37:24,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:24,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:24,222 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:37:24,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:24,222 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:24,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:24,400 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 44 proven. 14 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-07 10:37:24,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:24,401 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:37:24,401 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:37:24,401 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:37:24,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:24,401 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:37:24,415 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:37:24,415 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:37:24,451 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:37:24,452 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:37:24,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:37:24,599 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 44 proven. 14 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-07 10:37:24,600 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:37:24,702 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 44 proven. 14 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-07 10:37:24,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:37:24,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 23 [2018-11-07 10:37:24,722 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:37:24,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-07 10:37:24,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-07 10:37:24,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2018-11-07 10:37:24,723 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 23 states. [2018-11-07 10:37:25,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:25,193 INFO L93 Difference]: Finished difference Result 211 states and 246 transitions. [2018-11-07 10:37:25,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-07 10:37:25,194 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 59 [2018-11-07 10:37:25,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:25,195 INFO L225 Difference]: With dead ends: 211 [2018-11-07 10:37:25,196 INFO L226 Difference]: Without dead ends: 182 [2018-11-07 10:37:25,197 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 99 SyntacticMatches, 12 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=351, Invalid=1289, Unknown=0, NotChecked=0, Total=1640 [2018-11-07 10:37:25,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-11-07 10:37:25,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 76. [2018-11-07 10:37:25,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-07 10:37:25,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2018-11-07 10:37:25,221 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 59 [2018-11-07 10:37:25,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:25,221 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2018-11-07 10:37:25,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-07 10:37:25,221 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2018-11-07 10:37:25,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-07 10:37:25,222 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:25,222 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:25,222 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:25,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:25,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1451911001, now seen corresponding path program 4 times [2018-11-07 10:37:25,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:25,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:25,224 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:37:25,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:25,224 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:25,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:25,384 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 44 proven. 20 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-07 10:37:25,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:25,385 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:37:25,385 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:37:25,385 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:37:25,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:25,385 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:37:25,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:37:25,398 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:37:25,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:25,417 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:37:25,554 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 44 proven. 20 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-07 10:37:25,555 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:37:25,624 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 44 proven. 20 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-07 10:37:25,643 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:37:25,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 22 [2018-11-07 10:37:25,643 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:37:25,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-07 10:37:25,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-07 10:37:25,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=357, Unknown=0, NotChecked=0, Total=462 [2018-11-07 10:37:25,644 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 22 states. [2018-11-07 10:37:26,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:26,023 INFO L93 Difference]: Finished difference Result 238 states and 280 transitions. [2018-11-07 10:37:26,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-07 10:37:26,025 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 59 [2018-11-07 10:37:26,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:26,027 INFO L225 Difference]: With dead ends: 238 [2018-11-07 10:37:26,027 INFO L226 Difference]: Without dead ends: 209 [2018-11-07 10:37:26,028 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 100 SyntacticMatches, 12 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=315, Invalid=1091, Unknown=0, NotChecked=0, Total=1406 [2018-11-07 10:37:26,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-11-07 10:37:26,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 79. [2018-11-07 10:37:26,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-07 10:37:26,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 86 transitions. [2018-11-07 10:37:26,055 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 86 transitions. Word has length 59 [2018-11-07 10:37:26,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:26,055 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 86 transitions. [2018-11-07 10:37:26,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-07 10:37:26,055 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2018-11-07 10:37:26,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-07 10:37:26,056 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:26,056 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:26,056 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:26,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:26,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1954413347, now seen corresponding path program 8 times [2018-11-07 10:37:26,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:26,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:26,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:37:26,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:26,058 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:26,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:26,252 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 37 proven. 46 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-07 10:37:26,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:26,253 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:37:26,253 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:37:26,253 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:37:26,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:26,253 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 10:37:26,262 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:37:26,263 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:37:26,285 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-07 10:37:26,285 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:37:26,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:37:26,336 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 38 proven. 36 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-07 10:37:26,336 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:37:26,428 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 38 proven. 36 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-07 10:37:26,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:37:26,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 13 [2018-11-07 10:37:26,449 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:37:26,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-07 10:37:26,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-07 10:37:26,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-11-07 10:37:26,450 INFO L87 Difference]: Start difference. First operand 79 states and 86 transitions. Second operand 13 states. [2018-11-07 10:37:26,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:26,584 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2018-11-07 10:37:26,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 10:37:26,584 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 61 [2018-11-07 10:37:26,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:26,586 INFO L225 Difference]: With dead ends: 89 [2018-11-07 10:37:26,586 INFO L226 Difference]: Without dead ends: 87 [2018-11-07 10:37:26,587 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 116 SyntacticMatches, 11 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2018-11-07 10:37:26,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-11-07 10:37:26,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-11-07 10:37:26,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-07 10:37:26,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2018-11-07 10:37:26,613 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 61 [2018-11-07 10:37:26,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:26,613 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2018-11-07 10:37:26,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-07 10:37:26,613 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2018-11-07 10:37:26,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-07 10:37:26,614 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:26,614 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:26,615 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:26,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:26,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1550108743, now seen corresponding path program 9 times [2018-11-07 10:37:26,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:26,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:26,616 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:37:26,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:26,616 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:26,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:26,819 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 65 proven. 30 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 10:37:26,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:26,819 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:37:26,819 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:37:26,819 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:37:26,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:26,819 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 10:37:26,828 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:37:26,828 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:37:26,851 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:37:26,851 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:37:26,854 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:37:27,483 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 65 proven. 30 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 10:37:27,483 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:37:27,597 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 65 proven. 30 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 10:37:27,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:37:27,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 30 [2018-11-07 10:37:27,616 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:37:27,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-07 10:37:27,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-07 10:37:27,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=685, Unknown=0, NotChecked=0, Total=870 [2018-11-07 10:37:27,618 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand 30 states. [2018-11-07 10:37:28,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:28,111 INFO L93 Difference]: Finished difference Result 156 states and 176 transitions. [2018-11-07 10:37:28,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 10:37:28,113 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 69 [2018-11-07 10:37:28,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:28,114 INFO L225 Difference]: With dead ends: 156 [2018-11-07 10:37:28,114 INFO L226 Difference]: Without dead ends: 123 [2018-11-07 10:37:28,115 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 112 SyntacticMatches, 14 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 755 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=409, Invalid=1483, Unknown=0, NotChecked=0, Total=1892 [2018-11-07 10:37:28,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-11-07 10:37:28,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 89. [2018-11-07 10:37:28,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-07 10:37:28,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2018-11-07 10:37:28,138 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 69 [2018-11-07 10:37:28,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:28,138 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2018-11-07 10:37:28,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-07 10:37:28,138 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2018-11-07 10:37:28,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-07 10:37:28,139 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:28,139 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:28,139 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:28,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:28,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1825386707, now seen corresponding path program 7 times [2018-11-07 10:37:28,140 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:28,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:28,140 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:37:28,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:28,141 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:28,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:28,411 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 65 proven. 22 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 10:37:28,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:28,412 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:37:28,412 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:37:28,412 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:37:28,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:28,412 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 10:37:28,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:37:28,421 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:37:28,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:28,442 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:37:28,684 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 65 proven. 22 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 10:37:28,684 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:37:29,155 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 65 proven. 22 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 10:37:29,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:37:29,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 29 [2018-11-07 10:37:29,175 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:37:29,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-07 10:37:29,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-07 10:37:29,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=645, Unknown=0, NotChecked=0, Total=812 [2018-11-07 10:37:29,176 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand 29 states. [2018-11-07 10:37:29,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:29,665 INFO L93 Difference]: Finished difference Result 190 states and 217 transitions. [2018-11-07 10:37:29,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-07 10:37:29,666 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 69 [2018-11-07 10:37:29,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:29,667 INFO L225 Difference]: With dead ends: 190 [2018-11-07 10:37:29,667 INFO L226 Difference]: Without dead ends: 157 [2018-11-07 10:37:29,668 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 113 SyntacticMatches, 14 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 837 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=465, Invalid=1791, Unknown=0, NotChecked=0, Total=2256 [2018-11-07 10:37:29,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-11-07 10:37:29,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 89. [2018-11-07 10:37:29,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-07 10:37:29,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2018-11-07 10:37:29,693 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 69 [2018-11-07 10:37:29,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:29,694 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2018-11-07 10:37:29,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-07 10:37:29,694 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2018-11-07 10:37:29,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-07 10:37:29,694 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:29,695 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:29,695 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:29,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:29,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1995551649, now seen corresponding path program 8 times [2018-11-07 10:37:29,695 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:29,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:29,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:37:29,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:29,696 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:29,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:29,893 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 65 proven. 18 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 10:37:29,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:29,894 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:37:29,894 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:37:29,894 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:37:29,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:29,894 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 10:37:29,902 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:37:29,902 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:37:29,924 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-07 10:37:29,924 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:37:29,927 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:37:30,143 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 65 proven. 18 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 10:37:30,143 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:37:30,298 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 65 proven. 18 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 10:37:30,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:37:30,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 28 [2018-11-07 10:37:30,318 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:37:30,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-07 10:37:30,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-07 10:37:30,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=603, Unknown=0, NotChecked=0, Total=756 [2018-11-07 10:37:30,319 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand 28 states. [2018-11-07 10:37:30,651 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-07 10:37:31,000 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-11-07 10:37:31,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:31,303 INFO L93 Difference]: Finished difference Result 222 states and 256 transitions. [2018-11-07 10:37:31,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-07 10:37:31,304 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 69 [2018-11-07 10:37:31,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:31,305 INFO L225 Difference]: With dead ends: 222 [2018-11-07 10:37:31,305 INFO L226 Difference]: Without dead ends: 189 [2018-11-07 10:37:31,306 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 114 SyntacticMatches, 14 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 873 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=496, Invalid=1954, Unknown=0, NotChecked=0, Total=2450 [2018-11-07 10:37:31,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-11-07 10:37:31,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 89. [2018-11-07 10:37:31,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-07 10:37:31,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2018-11-07 10:37:31,334 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 69 [2018-11-07 10:37:31,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:31,335 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2018-11-07 10:37:31,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-07 10:37:31,335 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2018-11-07 10:37:31,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-07 10:37:31,335 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:31,335 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:31,336 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:31,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:31,336 INFO L82 PathProgramCache]: Analyzing trace with hash 632871659, now seen corresponding path program 9 times [2018-11-07 10:37:31,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:31,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:31,337 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:37:31,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:31,337 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:31,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:31,530 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 65 proven. 18 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 10:37:31,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:31,530 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:37:31,530 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:37:31,530 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:37:31,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:31,530 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 10:37:31,540 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:37:31,540 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:37:31,561 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:37:31,561 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:37:31,563 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:37:31,772 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 65 proven. 18 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 10:37:31,772 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:37:31,861 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 65 proven. 18 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 10:37:31,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:37:31,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 27 [2018-11-07 10:37:31,881 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:37:31,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-07 10:37:31,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-07 10:37:31,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=559, Unknown=0, NotChecked=0, Total=702 [2018-11-07 10:37:31,882 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand 27 states. [2018-11-07 10:37:32,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:32,971 INFO L93 Difference]: Finished difference Result 252 states and 293 transitions. [2018-11-07 10:37:32,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-07 10:37:32,971 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 69 [2018-11-07 10:37:32,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:32,972 INFO L225 Difference]: With dead ends: 252 [2018-11-07 10:37:32,973 INFO L226 Difference]: Without dead ends: 219 [2018-11-07 10:37:32,974 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 115 SyntacticMatches, 14 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 849 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=496, Invalid=1954, Unknown=0, NotChecked=0, Total=2450 [2018-11-07 10:37:32,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-11-07 10:37:33,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 89. [2018-11-07 10:37:33,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-07 10:37:33,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2018-11-07 10:37:33,011 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 69 [2018-11-07 10:37:33,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:33,013 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2018-11-07 10:37:33,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-07 10:37:33,014 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2018-11-07 10:37:33,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-07 10:37:33,014 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:33,014 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:33,015 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:33,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:33,015 INFO L82 PathProgramCache]: Analyzing trace with hash 613260407, now seen corresponding path program 10 times [2018-11-07 10:37:33,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:33,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:33,016 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:37:33,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:33,016 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:33,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:33,428 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 65 proven. 22 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 10:37:33,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:33,428 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:37:33,428 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:37:33,428 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:37:33,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:33,429 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 10:37:33,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:37:33,438 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:37:33,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:33,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:37:33,650 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 65 proven. 22 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 10:37:33,651 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:37:33,779 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 65 proven. 22 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 10:37:33,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:37:33,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 26 [2018-11-07 10:37:33,799 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:37:33,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-07 10:37:33,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-07 10:37:33,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=513, Unknown=0, NotChecked=0, Total=650 [2018-11-07 10:37:33,800 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand 26 states. [2018-11-07 10:37:34,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:34,346 INFO L93 Difference]: Finished difference Result 280 states and 328 transitions. [2018-11-07 10:37:34,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-07 10:37:34,346 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 69 [2018-11-07 10:37:34,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:34,348 INFO L225 Difference]: With dead ends: 280 [2018-11-07 10:37:34,348 INFO L226 Difference]: Without dead ends: 247 [2018-11-07 10:37:34,349 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 116 SyntacticMatches, 14 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 759 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=465, Invalid=1791, Unknown=0, NotChecked=0, Total=2256 [2018-11-07 10:37:34,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-11-07 10:37:34,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 89. [2018-11-07 10:37:34,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-07 10:37:34,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2018-11-07 10:37:34,386 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 69 [2018-11-07 10:37:34,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:34,386 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2018-11-07 10:37:34,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-07 10:37:34,387 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2018-11-07 10:37:34,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-07 10:37:34,387 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:34,387 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:34,388 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:34,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:34,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1618825475, now seen corresponding path program 5 times [2018-11-07 10:37:34,388 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:34,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:34,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:37:34,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:34,389 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:34,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:34,575 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 65 proven. 30 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 10:37:34,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:34,575 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:37:34,575 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:37:34,576 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:37:34,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:34,576 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 10:37:34,585 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:37:34,586 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:37:34,608 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-07 10:37:34,608 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:37:34,611 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:37:34,750 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 65 proven. 30 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 10:37:34,750 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:37:34,879 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 65 proven. 30 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 10:37:34,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:37:34,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 25 [2018-11-07 10:37:34,898 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:37:34,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-07 10:37:34,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-07 10:37:34,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=465, Unknown=0, NotChecked=0, Total=600 [2018-11-07 10:37:34,899 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand 25 states. [2018-11-07 10:37:35,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:35,576 INFO L93 Difference]: Finished difference Result 311 states and 367 transitions. [2018-11-07 10:37:35,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-07 10:37:35,577 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 69 [2018-11-07 10:37:35,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:35,579 INFO L225 Difference]: With dead ends: 311 [2018-11-07 10:37:35,579 INFO L226 Difference]: Without dead ends: 278 [2018-11-07 10:37:35,580 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 117 SyntacticMatches, 14 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 605 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=409, Invalid=1483, Unknown=0, NotChecked=0, Total=1892 [2018-11-07 10:37:35,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-11-07 10:37:35,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 92. [2018-11-07 10:37:35,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-07 10:37:35,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 100 transitions. [2018-11-07 10:37:35,628 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 100 transitions. Word has length 69 [2018-11-07 10:37:35,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:35,628 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 100 transitions. [2018-11-07 10:37:35,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-07 10:37:35,629 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 100 transitions. [2018-11-07 10:37:35,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-07 10:37:35,629 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:35,630 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:35,630 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:35,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:35,630 INFO L82 PathProgramCache]: Analyzing trace with hash 2111470529, now seen corresponding path program 10 times [2018-11-07 10:37:35,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:35,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:35,631 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:37:35,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:35,631 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:35,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:36,559 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 51 proven. 68 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-07 10:37:36,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:36,560 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:37:36,560 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:37:36,560 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:37:36,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:36,560 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 10:37:36,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:37:36,568 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:37:36,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:36,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:37:37,017 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 52 proven. 55 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 10:37:37,018 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:37:37,229 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 52 proven. 55 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 10:37:37,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:37:37,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 14 [2018-11-07 10:37:37,248 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:37:37,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 10:37:37,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 10:37:37,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2018-11-07 10:37:37,249 INFO L87 Difference]: Start difference. First operand 92 states and 100 transitions. Second operand 14 states. [2018-11-07 10:37:37,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:37,414 INFO L93 Difference]: Finished difference Result 102 states and 110 transitions. [2018-11-07 10:37:37,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 10:37:37,414 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 71 [2018-11-07 10:37:37,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:37,415 INFO L225 Difference]: With dead ends: 102 [2018-11-07 10:37:37,416 INFO L226 Difference]: Without dead ends: 100 [2018-11-07 10:37:37,416 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 135 SyntacticMatches, 13 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-11-07 10:37:37,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-11-07 10:37:37,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-11-07 10:37:37,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-07 10:37:37,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2018-11-07 10:37:37,457 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 71 [2018-11-07 10:37:37,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:37,457 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2018-11-07 10:37:37,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 10:37:37,457 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2018-11-07 10:37:37,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-07 10:37:37,458 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:37,458 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:37,458 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:37,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:37,459 INFO L82 PathProgramCache]: Analyzing trace with hash 58575589, now seen corresponding path program 11 times [2018-11-07 10:37:37,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:37,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:37,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:37:37,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:37,460 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:37,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:37,698 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 90 proven. 42 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-07 10:37:37,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:37,698 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:37:37,698 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:37:37,698 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:37:37,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:37,699 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 10:37:37,707 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:37:37,707 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:37:37,732 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-07 10:37:37,732 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:37:37,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:37:38,050 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 90 proven. 42 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-07 10:37:38,051 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:37:38,169 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 90 proven. 42 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-07 10:37:38,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:37:38,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 34 [2018-11-07 10:37:38,189 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:37:38,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-07 10:37:38,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-07 10:37:38,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 10:37:38,190 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand 34 states. [2018-11-07 10:37:39,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:39,017 INFO L93 Difference]: Finished difference Result 179 states and 202 transitions. [2018-11-07 10:37:39,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-07 10:37:39,017 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 79 [2018-11-07 10:37:39,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:39,018 INFO L225 Difference]: With dead ends: 179 [2018-11-07 10:37:39,018 INFO L226 Difference]: Without dead ends: 142 [2018-11-07 10:37:39,020 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 128 SyntacticMatches, 16 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1025 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=515, Invalid=1935, Unknown=0, NotChecked=0, Total=2450 [2018-11-07 10:37:39,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-11-07 10:37:39,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 102. [2018-11-07 10:37:39,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-07 10:37:39,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 110 transitions. [2018-11-07 10:37:39,059 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 110 transitions. Word has length 79 [2018-11-07 10:37:39,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:39,060 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 110 transitions. [2018-11-07 10:37:39,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-07 10:37:39,060 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 110 transitions. [2018-11-07 10:37:39,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-07 10:37:39,060 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:39,061 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:39,061 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:39,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:39,061 INFO L82 PathProgramCache]: Analyzing trace with hash 127267953, now seen corresponding path program 11 times [2018-11-07 10:37:39,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:39,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:39,062 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:37:39,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:39,062 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:39,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:39,348 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 90 proven. 32 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-07 10:37:39,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:39,348 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:37:39,349 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:37:39,349 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:37:39,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:39,349 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 10:37:39,361 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:37:39,361 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:37:39,391 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-07 10:37:39,391 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:37:39,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:37:39,679 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 90 proven. 32 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-07 10:37:39,679 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:37:39,790 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 90 proven. 32 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-07 10:37:39,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:37:39,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 33 [2018-11-07 10:37:39,812 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:37:39,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-07 10:37:39,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-07 10:37:39,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=842, Unknown=0, NotChecked=0, Total=1056 [2018-11-07 10:37:39,813 INFO L87 Difference]: Start difference. First operand 102 states and 110 transitions. Second operand 33 states. [2018-11-07 10:37:40,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:40,579 INFO L93 Difference]: Finished difference Result 219 states and 250 transitions. [2018-11-07 10:37:40,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-07 10:37:40,580 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 79 [2018-11-07 10:37:40,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:40,581 INFO L225 Difference]: With dead ends: 219 [2018-11-07 10:37:40,581 INFO L226 Difference]: Without dead ends: 182 [2018-11-07 10:37:40,583 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 129 SyntacticMatches, 16 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1155 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=595, Invalid=2375, Unknown=0, NotChecked=0, Total=2970 [2018-11-07 10:37:40,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-11-07 10:37:40,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 102. [2018-11-07 10:37:40,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-07 10:37:40,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 110 transitions. [2018-11-07 10:37:40,627 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 110 transitions. Word has length 79 [2018-11-07 10:37:40,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:40,627 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 110 transitions. [2018-11-07 10:37:40,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-07 10:37:40,627 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 110 transitions. [2018-11-07 10:37:40,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-07 10:37:40,628 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:40,628 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:40,628 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:40,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:40,629 INFO L82 PathProgramCache]: Analyzing trace with hash 310579453, now seen corresponding path program 12 times [2018-11-07 10:37:40,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:40,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:40,630 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:37:40,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:40,630 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:40,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:41,647 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 90 proven. 26 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-07 10:37:41,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:41,648 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:37:41,648 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:37:41,648 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:37:41,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:41,648 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 10:37:41,657 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:37:41,657 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:37:41,679 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:37:41,680 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:37:41,682 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:37:41,960 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 90 proven. 26 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-07 10:37:41,961 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:37:42,126 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 90 proven. 26 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-07 10:37:42,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:37:42,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 32 [2018-11-07 10:37:42,146 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:37:42,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-07 10:37:42,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-07 10:37:42,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=795, Unknown=0, NotChecked=0, Total=992 [2018-11-07 10:37:42,147 INFO L87 Difference]: Start difference. First operand 102 states and 110 transitions. Second operand 32 states. [2018-11-07 10:37:43,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:43,415 INFO L93 Difference]: Finished difference Result 257 states and 296 transitions. [2018-11-07 10:37:43,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-07 10:37:43,415 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 79 [2018-11-07 10:37:43,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:43,417 INFO L225 Difference]: With dead ends: 257 [2018-11-07 10:37:43,417 INFO L226 Difference]: Without dead ends: 220 [2018-11-07 10:37:43,419 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 130 SyntacticMatches, 16 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1236 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=649, Invalid=2657, Unknown=0, NotChecked=0, Total=3306 [2018-11-07 10:37:43,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-11-07 10:37:43,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 102. [2018-11-07 10:37:43,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-07 10:37:43,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 110 transitions. [2018-11-07 10:37:43,487 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 110 transitions. Word has length 79 [2018-11-07 10:37:43,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:43,488 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 110 transitions. [2018-11-07 10:37:43,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-07 10:37:43,488 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 110 transitions. [2018-11-07 10:37:43,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-07 10:37:43,489 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:43,489 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:43,489 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:43,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:43,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1427775351, now seen corresponding path program 13 times [2018-11-07 10:37:43,490 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:43,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:43,490 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:37:43,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:43,491 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:43,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:44,937 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 90 proven. 24 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-07 10:37:44,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:44,937 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:37:44,937 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:37:44,937 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:37:44,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:44,938 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 10:37:44,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:37:44,949 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:37:44,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:44,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:37:45,252 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 90 proven. 24 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-07 10:37:45,252 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:37:45,361 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 90 proven. 24 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-07 10:37:45,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:37:45,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 31 [2018-11-07 10:37:45,380 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:37:45,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-07 10:37:45,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-07 10:37:45,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=746, Unknown=0, NotChecked=0, Total=930 [2018-11-07 10:37:45,382 INFO L87 Difference]: Start difference. First operand 102 states and 110 transitions. Second operand 31 states. [2018-11-07 10:37:46,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:46,164 INFO L93 Difference]: Finished difference Result 293 states and 340 transitions. [2018-11-07 10:37:46,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-07 10:37:46,165 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 79 [2018-11-07 10:37:46,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:46,166 INFO L225 Difference]: With dead ends: 293 [2018-11-07 10:37:46,166 INFO L226 Difference]: Without dead ends: 256 [2018-11-07 10:37:46,168 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 131 SyntacticMatches, 16 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1248 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=668, Invalid=2754, Unknown=0, NotChecked=0, Total=3422 [2018-11-07 10:37:46,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-11-07 10:37:46,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 102. [2018-11-07 10:37:46,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-07 10:37:46,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 110 transitions. [2018-11-07 10:37:46,230 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 110 transitions. Word has length 79 [2018-11-07 10:37:46,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:46,230 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 110 transitions. [2018-11-07 10:37:46,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-07 10:37:46,230 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 110 transitions. [2018-11-07 10:37:46,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-07 10:37:46,231 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:46,231 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:46,231 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:46,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:46,232 INFO L82 PathProgramCache]: Analyzing trace with hash 143598357, now seen corresponding path program 14 times [2018-11-07 10:37:46,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:46,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:46,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:37:46,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:46,233 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:46,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:46,491 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 90 proven. 26 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-07 10:37:46,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:46,491 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:37:46,491 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:37:46,491 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:37:46,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:46,492 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 10:37:46,500 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:37:46,500 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:37:46,523 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-07 10:37:46,523 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:37:46,525 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:37:46,750 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 90 proven. 26 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-07 10:37:46,750 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:37:46,880 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 90 proven. 26 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-07 10:37:46,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:37:46,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 30 [2018-11-07 10:37:46,900 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:37:46,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-07 10:37:46,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-07 10:37:46,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=695, Unknown=0, NotChecked=0, Total=870 [2018-11-07 10:37:46,901 INFO L87 Difference]: Start difference. First operand 102 states and 110 transitions. Second operand 30 states. [2018-11-07 10:37:47,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:47,668 INFO L93 Difference]: Finished difference Result 327 states and 382 transitions. [2018-11-07 10:37:47,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-07 10:37:47,668 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 79 [2018-11-07 10:37:47,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:47,669 INFO L225 Difference]: With dead ends: 327 [2018-11-07 10:37:47,669 INFO L226 Difference]: Without dead ends: 290 [2018-11-07 10:37:47,671 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 132 SyntacticMatches, 16 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1182 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=649, Invalid=2657, Unknown=0, NotChecked=0, Total=3306 [2018-11-07 10:37:47,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-11-07 10:37:47,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 102. [2018-11-07 10:37:47,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-07 10:37:47,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 110 transitions. [2018-11-07 10:37:47,718 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 110 transitions. Word has length 79 [2018-11-07 10:37:47,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:47,718 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 110 transitions. [2018-11-07 10:37:47,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-07 10:37:47,718 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 110 transitions. [2018-11-07 10:37:47,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-07 10:37:47,719 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:47,719 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:47,719 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:47,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:47,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1602250591, now seen corresponding path program 15 times [2018-11-07 10:37:47,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:47,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:47,720 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:37:47,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:47,720 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:47,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:47,929 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 90 proven. 32 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-07 10:37:47,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:47,929 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:37:47,929 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:37:47,930 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:37:47,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:47,930 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 10:37:47,937 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:37:47,938 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:37:47,956 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:37:47,956 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:37:47,958 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:37:48,142 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 90 proven. 32 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-07 10:37:48,142 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:37:48,253 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 90 proven. 32 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-07 10:37:48,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:37:48,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 29 [2018-11-07 10:37:48,272 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:37:48,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-07 10:37:48,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-07 10:37:48,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2018-11-07 10:37:48,273 INFO L87 Difference]: Start difference. First operand 102 states and 110 transitions. Second operand 29 states. [2018-11-07 10:37:49,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:49,263 INFO L93 Difference]: Finished difference Result 359 states and 422 transitions. [2018-11-07 10:37:49,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-07 10:37:49,265 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 79 [2018-11-07 10:37:49,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:49,267 INFO L225 Difference]: With dead ends: 359 [2018-11-07 10:37:49,268 INFO L226 Difference]: Without dead ends: 322 [2018-11-07 10:37:49,269 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 133 SyntacticMatches, 16 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1035 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=595, Invalid=2375, Unknown=0, NotChecked=0, Total=2970 [2018-11-07 10:37:49,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-11-07 10:37:49,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 102. [2018-11-07 10:37:49,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-07 10:37:49,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 110 transitions. [2018-11-07 10:37:49,338 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 110 transitions. Word has length 79 [2018-11-07 10:37:49,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:49,338 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 110 transitions. [2018-11-07 10:37:49,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-07 10:37:49,338 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 110 transitions. [2018-11-07 10:37:49,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-07 10:37:49,339 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:49,339 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:49,339 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:49,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:49,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1326972627, now seen corresponding path program 6 times [2018-11-07 10:37:49,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:49,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:49,340 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:37:49,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:49,341 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:49,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:50,582 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 90 proven. 42 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-07 10:37:50,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:50,583 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:37:50,583 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:37:50,583 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:37:50,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:50,583 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 10:37:50,591 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:37:50,591 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:37:50,613 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:37:50,613 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:37:50,615 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:37:50,792 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 90 proven. 42 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-07 10:37:50,793 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:37:50,895 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 90 proven. 42 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-07 10:37:50,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:37:50,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 28 [2018-11-07 10:37:50,915 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:37:50,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-07 10:37:50,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-07 10:37:50,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=587, Unknown=0, NotChecked=0, Total=756 [2018-11-07 10:37:50,916 INFO L87 Difference]: Start difference. First operand 102 states and 110 transitions. Second operand 28 states. [2018-11-07 10:37:51,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:51,720 INFO L93 Difference]: Finished difference Result 394 states and 466 transitions. [2018-11-07 10:37:51,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-07 10:37:51,721 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 79 [2018-11-07 10:37:51,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:51,723 INFO L225 Difference]: With dead ends: 394 [2018-11-07 10:37:51,723 INFO L226 Difference]: Without dead ends: 357 [2018-11-07 10:37:51,724 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 134 SyntacticMatches, 16 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 815 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=515, Invalid=1935, Unknown=0, NotChecked=0, Total=2450 [2018-11-07 10:37:51,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2018-11-07 10:37:51,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 105. [2018-11-07 10:37:51,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-07 10:37:51,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 114 transitions. [2018-11-07 10:37:51,786 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 114 transitions. Word has length 79 [2018-11-07 10:37:51,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:51,786 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 114 transitions. [2018-11-07 10:37:51,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-07 10:37:51,787 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 114 transitions. [2018-11-07 10:37:51,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-07 10:37:51,787 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:51,787 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:51,787 INFO L423 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:51,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:51,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1957490143, now seen corresponding path program 12 times [2018-11-07 10:37:51,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:51,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:51,788 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:37:51,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:51,788 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:51,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:52,054 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 67 proven. 94 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-07 10:37:52,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:52,054 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:37:52,054 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:37:52,054 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:37:52,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:52,055 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 10:37:52,062 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:37:52,063 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:37:52,085 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:37:52,085 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:37:52,087 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:37:52,134 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 68 proven. 78 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-07 10:37:52,135 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:37:52,244 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 68 proven. 78 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-07 10:37:52,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:37:52,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 15 [2018-11-07 10:37:52,264 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:37:52,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-07 10:37:52,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-07 10:37:52,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2018-11-07 10:37:52,265 INFO L87 Difference]: Start difference. First operand 105 states and 114 transitions. Second operand 15 states. [2018-11-07 10:37:52,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:52,526 INFO L93 Difference]: Finished difference Result 115 states and 124 transitions. [2018-11-07 10:37:52,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-07 10:37:52,526 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 81 [2018-11-07 10:37:52,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:52,528 INFO L225 Difference]: With dead ends: 115 [2018-11-07 10:37:52,529 INFO L226 Difference]: Without dead ends: 113 [2018-11-07 10:37:52,529 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 154 SyntacticMatches, 15 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2018-11-07 10:37:52,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-11-07 10:37:52,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-11-07 10:37:52,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-11-07 10:37:52,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 122 transitions. [2018-11-07 10:37:52,587 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 122 transitions. Word has length 81 [2018-11-07 10:37:52,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:52,587 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 122 transitions. [2018-11-07 10:37:52,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-07 10:37:52,588 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 122 transitions. [2018-11-07 10:37:52,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-07 10:37:52,588 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:52,588 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:52,589 INFO L423 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:52,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:52,589 INFO L82 PathProgramCache]: Analyzing trace with hash -507298045, now seen corresponding path program 13 times [2018-11-07 10:37:52,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:52,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:52,590 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:37:52,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:52,590 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:52,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:52,927 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 119 proven. 56 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 10:37:52,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:52,927 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:37:52,927 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:37:52,927 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:37:52,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:52,928 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 10:37:52,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:37:52,936 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:37:52,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:52,961 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:37:53,289 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 119 proven. 56 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 10:37:53,289 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:37:53,459 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 119 proven. 56 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 10:37:53,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:37:53,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 38 [2018-11-07 10:37:53,479 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:37:53,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-07 10:37:53,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-07 10:37:53,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=1115, Unknown=0, NotChecked=0, Total=1406 [2018-11-07 10:37:53,480 INFO L87 Difference]: Start difference. First operand 113 states and 122 transitions. Second operand 38 states. [2018-11-07 10:37:54,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:54,272 INFO L93 Difference]: Finished difference Result 202 states and 228 transitions. [2018-11-07 10:37:54,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-07 10:37:54,272 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 89 [2018-11-07 10:37:54,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:54,273 INFO L225 Difference]: With dead ends: 202 [2018-11-07 10:37:54,274 INFO L226 Difference]: Without dead ends: 161 [2018-11-07 10:37:54,274 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 144 SyntacticMatches, 18 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1336 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=633, Invalid=2447, Unknown=0, NotChecked=0, Total=3080 [2018-11-07 10:37:54,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-11-07 10:37:54,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 115. [2018-11-07 10:37:54,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-07 10:37:54,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2018-11-07 10:37:54,346 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 89 [2018-11-07 10:37:54,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:54,346 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2018-11-07 10:37:54,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-07 10:37:54,347 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2018-11-07 10:37:54,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-07 10:37:54,347 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:54,347 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:54,348 INFO L423 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:54,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:54,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1248990833, now seen corresponding path program 16 times [2018-11-07 10:37:54,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:54,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:54,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:37:54,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:54,349 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:54,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:54,608 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 119 proven. 44 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 10:37:54,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:54,608 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:37:54,608 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:37:54,608 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:37:54,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:54,608 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 10:37:54,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:37:54,616 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:37:54,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:54,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:37:54,986 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 119 proven. 44 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 10:37:54,986 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:37:55,121 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 119 proven. 44 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 10:37:55,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:37:55,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 37 [2018-11-07 10:37:55,141 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:37:55,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-07 10:37:55,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-07 10:37:55,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=1065, Unknown=0, NotChecked=0, Total=1332 [2018-11-07 10:37:55,142 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. Second operand 37 states. [2018-11-07 10:37:56,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:56,076 INFO L93 Difference]: Finished difference Result 248 states and 283 transitions. [2018-11-07 10:37:56,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-07 10:37:56,077 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 89 [2018-11-07 10:37:56,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:56,078 INFO L225 Difference]: With dead ends: 248 [2018-11-07 10:37:56,078 INFO L226 Difference]: Without dead ends: 207 [2018-11-07 10:37:56,079 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 145 SyntacticMatches, 18 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1524 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=741, Invalid=3041, Unknown=0, NotChecked=0, Total=3782 [2018-11-07 10:37:56,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-11-07 10:37:56,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 115. [2018-11-07 10:37:56,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-07 10:37:56,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2018-11-07 10:37:56,164 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 89 [2018-11-07 10:37:56,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:56,164 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2018-11-07 10:37:56,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-07 10:37:56,164 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2018-11-07 10:37:56,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-07 10:37:56,165 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:56,165 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 6, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:56,165 INFO L423 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:56,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:56,165 INFO L82 PathProgramCache]: Analyzing trace with hash 752469787, now seen corresponding path program 17 times [2018-11-07 10:37:56,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:56,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:56,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:37:56,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:56,166 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:56,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:56,610 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 119 proven. 36 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 10:37:56,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:56,610 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:37:56,610 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:37:56,610 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:37:56,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:56,611 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 10:37:56,619 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:37:56,619 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:37:56,747 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-07 10:37:56,747 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:37:56,750 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:37:57,446 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 119 proven. 36 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 10:37:57,446 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:37:57,582 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 119 proven. 36 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 10:37:57,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:37:57,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 36 [2018-11-07 10:37:57,602 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:37:57,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-07 10:37:57,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-07 10:37:57,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=1013, Unknown=0, NotChecked=0, Total=1260 [2018-11-07 10:37:57,604 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. Second operand 36 states. [2018-11-07 10:37:58,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:58,572 INFO L93 Difference]: Finished difference Result 292 states and 336 transitions. [2018-11-07 10:37:58,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-07 10:37:58,572 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 89 [2018-11-07 10:37:58,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:58,573 INFO L225 Difference]: With dead ends: 292 [2018-11-07 10:37:58,573 INFO L226 Difference]: Without dead ends: 251 [2018-11-07 10:37:58,574 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 146 SyntacticMatches, 18 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1662 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=823, Invalid=3467, Unknown=0, NotChecked=0, Total=4290 [2018-11-07 10:37:58,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-11-07 10:37:58,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 115. [2018-11-07 10:37:58,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-07 10:37:58,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2018-11-07 10:37:58,657 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 89 [2018-11-07 10:37:58,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:58,657 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2018-11-07 10:37:58,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-07 10:37:58,658 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2018-11-07 10:37:58,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-07 10:37:58,658 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:58,658 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 5, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:58,659 INFO L423 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:58,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:58,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1940416601, now seen corresponding path program 18 times [2018-11-07 10:37:58,659 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:58,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:58,660 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:37:58,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:58,660 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:58,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:59,341 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 119 proven. 32 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 10:37:59,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:59,341 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:37:59,341 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:37:59,342 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:37:59,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:59,342 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 10:37:59,350 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:37:59,350 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:37:59,376 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:37:59,376 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:37:59,378 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:37:59,870 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 119 proven. 32 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 10:37:59,871 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:38:00,002 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 119 proven. 32 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 10:38:00,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:38:00,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 35 [2018-11-07 10:38:00,021 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:38:00,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-07 10:38:00,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-07 10:38:00,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=959, Unknown=0, NotChecked=0, Total=1190 [2018-11-07 10:38:00,022 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. Second operand 35 states. [2018-11-07 10:38:01,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:38:01,166 INFO L93 Difference]: Finished difference Result 334 states and 387 transitions. [2018-11-07 10:38:01,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-07 10:38:01,167 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 89 [2018-11-07 10:38:01,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:38:01,168 INFO L225 Difference]: With dead ends: 334 [2018-11-07 10:38:01,168 INFO L226 Difference]: Without dead ends: 293 [2018-11-07 10:38:01,169 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 147 SyntacticMatches, 18 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1724 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=867, Invalid=3689, Unknown=0, NotChecked=0, Total=4556 [2018-11-07 10:38:01,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-11-07 10:38:01,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 115. [2018-11-07 10:38:01,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-07 10:38:01,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2018-11-07 10:38:01,254 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 89 [2018-11-07 10:38:01,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:38:01,254 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2018-11-07 10:38:01,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-07 10:38:01,255 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2018-11-07 10:38:01,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-07 10:38:01,255 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:38:01,256 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 5, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:38:01,256 INFO L423 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:38:01,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:38:01,256 INFO L82 PathProgramCache]: Analyzing trace with hash 233315123, now seen corresponding path program 19 times [2018-11-07 10:38:01,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:38:01,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:01,257 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:38:01,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:01,257 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:38:01,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:38:01,617 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 119 proven. 32 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 10:38:01,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:38:01,617 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:38:01,617 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:38:01,617 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:38:01,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:38:01,617 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 10:38:01,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:38:01,626 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:38:01,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:38:01,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:38:01,914 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 119 proven. 32 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 10:38:01,914 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:38:02,224 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 119 proven. 32 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 10:38:02,244 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:38:02,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 34 [2018-11-07 10:38:02,245 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:38:02,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-07 10:38:02,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-07 10:38:02,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=903, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 10:38:02,246 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. Second operand 34 states. [2018-11-07 10:38:03,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:38:03,435 INFO L93 Difference]: Finished difference Result 374 states and 436 transitions. [2018-11-07 10:38:03,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-07 10:38:03,436 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 89 [2018-11-07 10:38:03,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:38:03,438 INFO L225 Difference]: With dead ends: 374 [2018-11-07 10:38:03,438 INFO L226 Difference]: Without dead ends: 333 [2018-11-07 10:38:03,439 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 148 SyntacticMatches, 18 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1696 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=867, Invalid=3689, Unknown=0, NotChecked=0, Total=4556 [2018-11-07 10:38:03,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-11-07 10:38:03,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 115. [2018-11-07 10:38:03,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-07 10:38:03,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2018-11-07 10:38:03,512 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 89 [2018-11-07 10:38:03,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:38:03,513 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2018-11-07 10:38:03,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-07 10:38:03,513 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2018-11-07 10:38:03,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-07 10:38:03,513 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:38:03,514 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 6, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:38:03,514 INFO L423 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:38:03,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:38:03,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1822167487, now seen corresponding path program 20 times [2018-11-07 10:38:03,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:38:03,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:03,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:38:03,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:03,515 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:38:03,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:38:04,180 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 119 proven. 36 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 10:38:04,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:38:04,180 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:38:04,180 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:38:04,180 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:38:04,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:38:04,181 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 10:38:04,189 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:38:04,189 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:38:04,216 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-07 10:38:04,216 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:38:04,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:38:04,552 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 119 proven. 36 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 10:38:04,552 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:38:04,729 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 119 proven. 36 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 10:38:04,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:38:04,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 33 [2018-11-07 10:38:04,748 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:38:04,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-07 10:38:04,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-07 10:38:04,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=845, Unknown=0, NotChecked=0, Total=1056 [2018-11-07 10:38:04,749 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. Second operand 33 states. [2018-11-07 10:38:05,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:38:05,900 INFO L93 Difference]: Finished difference Result 412 states and 483 transitions. [2018-11-07 10:38:05,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-07 10:38:05,900 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 89 [2018-11-07 10:38:05,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:38:05,902 INFO L225 Difference]: With dead ends: 412 [2018-11-07 10:38:05,902 INFO L226 Difference]: Without dead ends: 371 [2018-11-07 10:38:05,903 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 149 SyntacticMatches, 18 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1572 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=823, Invalid=3467, Unknown=0, NotChecked=0, Total=4290 [2018-11-07 10:38:05,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2018-11-07 10:38:05,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 115. [2018-11-07 10:38:05,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-07 10:38:05,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2018-11-07 10:38:05,996 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 89 [2018-11-07 10:38:05,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:38:05,996 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2018-11-07 10:38:05,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-07 10:38:05,996 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2018-11-07 10:38:05,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-07 10:38:05,997 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:38:05,997 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:38:05,997 INFO L423 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:38:05,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:38:05,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1890859851, now seen corresponding path program 21 times [2018-11-07 10:38:05,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:38:05,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:05,998 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:38:05,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:05,998 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:38:06,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:38:06,198 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 119 proven. 44 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 10:38:06,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:38:06,199 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:38:06,199 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:38:06,199 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:38:06,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:38:06,199 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 10:38:06,207 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:38:06,208 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:38:06,236 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:38:06,236 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:38:06,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:38:06,739 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 119 proven. 44 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 10:38:06,739 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:38:06,864 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 119 proven. 44 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 10:38:06,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:38:06,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 32 [2018-11-07 10:38:06,884 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:38:06,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-07 10:38:06,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-07 10:38:06,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=785, Unknown=0, NotChecked=0, Total=992 [2018-11-07 10:38:06,885 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. Second operand 32 states. [2018-11-07 10:38:08,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:38:08,481 INFO L93 Difference]: Finished difference Result 448 states and 528 transitions. [2018-11-07 10:38:08,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-07 10:38:08,481 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 89 [2018-11-07 10:38:08,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:38:08,483 INFO L225 Difference]: With dead ends: 448 [2018-11-07 10:38:08,483 INFO L226 Difference]: Without dead ends: 407 [2018-11-07 10:38:08,484 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 150 SyntacticMatches, 18 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1354 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=741, Invalid=3041, Unknown=0, NotChecked=0, Total=3782 [2018-11-07 10:38:08,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2018-11-07 10:38:08,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 115. [2018-11-07 10:38:08,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-07 10:38:08,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2018-11-07 10:38:08,571 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 89 [2018-11-07 10:38:08,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:38:08,572 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2018-11-07 10:38:08,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-07 10:38:08,572 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2018-11-07 10:38:08,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-07 10:38:08,572 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:38:08,572 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:38:08,573 INFO L423 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:38:08,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:38:08,573 INFO L82 PathProgramCache]: Analyzing trace with hash 2074171351, now seen corresponding path program 7 times [2018-11-07 10:38:08,573 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:38:08,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:08,574 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:38:08,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:08,574 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:38:08,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:38:09,470 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 119 proven. 56 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 10:38:09,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:38:09,471 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:38:09,471 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:38:09,471 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:38:09,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:38:09,471 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 10:38:09,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:38:09,480 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:38:09,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:38:09,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:38:09,706 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 119 proven. 56 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 10:38:09,706 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:38:09,834 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 119 proven. 56 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 10:38:09,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:38:09,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 31 [2018-11-07 10:38:09,855 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:38:09,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-07 10:38:09,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-07 10:38:09,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=723, Unknown=0, NotChecked=0, Total=930 [2018-11-07 10:38:09,856 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. Second operand 31 states. [2018-11-07 10:38:10,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:38:10,999 INFO L93 Difference]: Finished difference Result 487 states and 577 transitions. [2018-11-07 10:38:11,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-07 10:38:11,000 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 89 [2018-11-07 10:38:11,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:38:11,002 INFO L225 Difference]: With dead ends: 487 [2018-11-07 10:38:11,002 INFO L226 Difference]: Without dead ends: 446 [2018-11-07 10:38:11,003 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 151 SyntacticMatches, 18 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1056 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=633, Invalid=2447, Unknown=0, NotChecked=0, Total=3080 [2018-11-07 10:38:11,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2018-11-07 10:38:11,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 118. [2018-11-07 10:38:11,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-11-07 10:38:11,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 128 transitions. [2018-11-07 10:38:11,096 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 128 transitions. Word has length 89 [2018-11-07 10:38:11,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:38:11,096 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 128 transitions. [2018-11-07 10:38:11,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-07 10:38:11,097 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 128 transitions. [2018-11-07 10:38:11,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-07 10:38:11,097 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:38:11,098 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:38:11,098 INFO L423 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:38:11,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:38:11,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1421446787, now seen corresponding path program 14 times [2018-11-07 10:38:11,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:38:11,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:11,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:38:11,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:11,099 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:38:11,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:38:11,289 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 85 proven. 124 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-07 10:38:11,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:38:11,290 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:38:11,290 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:38:11,290 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:38:11,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:38:11,290 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 10:38:11,300 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:38:11,300 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:38:11,331 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-07 10:38:11,331 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:38:11,334 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:38:11,421 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 86 proven. 105 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 10:38:11,421 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:38:11,505 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 86 proven. 105 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 10:38:11,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:38:11,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 16 [2018-11-07 10:38:11,524 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:38:11,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-07 10:38:11,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-07 10:38:11,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2018-11-07 10:38:11,525 INFO L87 Difference]: Start difference. First operand 118 states and 128 transitions. Second operand 16 states. [2018-11-07 10:38:12,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:38:12,116 INFO L93 Difference]: Finished difference Result 128 states and 138 transitions. [2018-11-07 10:38:12,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-07 10:38:12,116 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 91 [2018-11-07 10:38:12,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:38:12,117 INFO L225 Difference]: With dead ends: 128 [2018-11-07 10:38:12,118 INFO L226 Difference]: Without dead ends: 126 [2018-11-07 10:38:12,118 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 173 SyntacticMatches, 17 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2018-11-07 10:38:12,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-11-07 10:38:12,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-11-07 10:38:12,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-11-07 10:38:12,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 136 transitions. [2018-11-07 10:38:12,225 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 136 transitions. Word has length 91 [2018-11-07 10:38:12,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:38:12,226 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 136 transitions. [2018-11-07 10:38:12,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-07 10:38:12,226 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 136 transitions. [2018-11-07 10:38:12,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-07 10:38:12,226 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:38:12,227 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:38:12,227 INFO L423 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:38:12,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:38:12,227 INFO L82 PathProgramCache]: Analyzing trace with hash -161069919, now seen corresponding path program 15 times [2018-11-07 10:38:12,227 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:38:12,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:12,228 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:38:12,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:12,228 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:38:12,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:38:12,805 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 152 proven. 72 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-07 10:38:12,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:38:12,805 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:38:12,805 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:38:12,805 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:38:12,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:38:12,805 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 10:38:12,816 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:38:12,816 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:38:12,843 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:38:12,843 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:38:12,845 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:38:13,963 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 152 proven. 72 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-07 10:38:13,963 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:38:14,131 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 152 proven. 72 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-07 10:38:14,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:38:14,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 42 [2018-11-07 10:38:14,150 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:38:14,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-07 10:38:14,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-07 10:38:14,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=353, Invalid=1369, Unknown=0, NotChecked=0, Total=1722 [2018-11-07 10:38:14,152 INFO L87 Difference]: Start difference. First operand 126 states and 136 transitions. Second operand 42 states. [2018-11-07 10:38:15,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:38:15,035 INFO L93 Difference]: Finished difference Result 225 states and 254 transitions. [2018-11-07 10:38:15,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-07 10:38:15,035 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 99 [2018-11-07 10:38:15,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:38:15,036 INFO L225 Difference]: With dead ends: 225 [2018-11-07 10:38:15,037 INFO L226 Difference]: Without dead ends: 180 [2018-11-07 10:38:15,037 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 160 SyntacticMatches, 20 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1688 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=763, Invalid=3019, Unknown=0, NotChecked=0, Total=3782 [2018-11-07 10:38:15,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-11-07 10:38:15,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 128. [2018-11-07 10:38:15,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-11-07 10:38:15,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2018-11-07 10:38:15,179 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 99 [2018-11-07 10:38:15,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:38:15,179 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2018-11-07 10:38:15,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-07 10:38:15,180 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2018-11-07 10:38:15,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-07 10:38:15,180 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:38:15,181 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:38:15,181 INFO L423 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:38:15,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:38:15,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1635135533, now seen corresponding path program 22 times [2018-11-07 10:38:15,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:38:15,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:15,182 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:38:15,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:15,182 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:38:15,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:38:15,653 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 152 proven. 58 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-07 10:38:15,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:38:15,653 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:38:15,653 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:38:15,653 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:38:15,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:38:15,653 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 10:38:15,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:38:15,662 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:38:15,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:38:15,693 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:38:16,041 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 152 proven. 58 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-07 10:38:16,041 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:38:16,214 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 152 proven. 58 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-07 10:38:16,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:38:16,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 41 [2018-11-07 10:38:16,233 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:38:16,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-07 10:38:16,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-07 10:38:16,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=1314, Unknown=0, NotChecked=0, Total=1640 [2018-11-07 10:38:16,234 INFO L87 Difference]: Start difference. First operand 128 states and 138 transitions. Second operand 41 states. [2018-11-07 10:38:17,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:38:17,351 INFO L93 Difference]: Finished difference Result 277 states and 316 transitions. [2018-11-07 10:38:17,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-07 10:38:17,352 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 99 [2018-11-07 10:38:17,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:38:17,353 INFO L225 Difference]: With dead ends: 277 [2018-11-07 10:38:17,353 INFO L226 Difference]: Without dead ends: 232 [2018-11-07 10:38:17,353 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 161 SyntacticMatches, 20 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1944 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=903, Invalid=3789, Unknown=0, NotChecked=0, Total=4692 [2018-11-07 10:38:17,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-11-07 10:38:17,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 128. [2018-11-07 10:38:17,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-11-07 10:38:17,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2018-11-07 10:38:17,452 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 99 [2018-11-07 10:38:17,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:38:17,452 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2018-11-07 10:38:17,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-07 10:38:17,452 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2018-11-07 10:38:17,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-07 10:38:17,453 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:38:17,453 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 7, 6, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:38:17,453 INFO L423 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:38:17,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:38:17,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1382256313, now seen corresponding path program 23 times [2018-11-07 10:38:17,454 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:38:17,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:17,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:38:17,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:17,455 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:38:17,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:38:18,054 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 152 proven. 48 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-07 10:38:18,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:38:18,055 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:38:18,055 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:38:18,055 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:38:18,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:38:18,055 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:38:18,064 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:38:18,064 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:38:18,112 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-07 10:38:18,112 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:38:18,114 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:38:19,561 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 152 proven. 48 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-07 10:38:19,561 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:38:19,823 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 152 proven. 48 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-07 10:38:19,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:38:19,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 40 [2018-11-07 10:38:19,842 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:38:19,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-07 10:38:19,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-07 10:38:19,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=1257, Unknown=0, NotChecked=0, Total=1560 [2018-11-07 10:38:19,843 INFO L87 Difference]: Start difference. First operand 128 states and 138 transitions. Second operand 40 states. [2018-11-07 10:38:21,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:38:21,046 INFO L93 Difference]: Finished difference Result 327 states and 376 transitions. [2018-11-07 10:38:21,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-07 10:38:21,046 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 99 [2018-11-07 10:38:21,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:38:21,047 INFO L225 Difference]: With dead ends: 327 [2018-11-07 10:38:21,047 INFO L226 Difference]: Without dead ends: 282 [2018-11-07 10:38:21,048 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 162 SyntacticMatches, 20 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2151 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1018, Invalid=4384, Unknown=0, NotChecked=0, Total=5402 [2018-11-07 10:38:21,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-11-07 10:38:21,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 128. [2018-11-07 10:38:21,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-11-07 10:38:21,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2018-11-07 10:38:21,146 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 99 [2018-11-07 10:38:21,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:38:21,146 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2018-11-07 10:38:21,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-07 10:38:21,146 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2018-11-07 10:38:21,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-07 10:38:21,147 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:38:21,147 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 6, 5, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:38:21,147 INFO L423 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:38:21,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:38:21,148 INFO L82 PathProgramCache]: Analyzing trace with hash 2012160069, now seen corresponding path program 24 times [2018-11-07 10:38:21,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:38:21,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:21,148 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:38:21,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:21,148 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:38:21,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:38:21,461 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 152 proven. 42 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-07 10:38:21,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:38:21,462 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:38:21,462 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:38:21,462 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:38:21,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:38:21,462 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:38:21,470 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:38:21,470 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:38:21,496 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:38:21,496 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:38:21,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:38:21,815 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 152 proven. 42 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-07 10:38:21,815 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:38:21,996 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 152 proven. 42 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-07 10:38:22,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:38:22,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 39 [2018-11-07 10:38:22,015 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:38:22,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-07 10:38:22,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-07 10:38:22,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=284, Invalid=1198, Unknown=0, NotChecked=0, Total=1482 [2018-11-07 10:38:22,016 INFO L87 Difference]: Start difference. First operand 128 states and 138 transitions. Second operand 39 states. [2018-11-07 10:38:23,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:38:23,468 INFO L93 Difference]: Finished difference Result 375 states and 434 transitions. [2018-11-07 10:38:23,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-07 10:38:23,468 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 99 [2018-11-07 10:38:23,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:38:23,470 INFO L225 Difference]: With dead ends: 375 [2018-11-07 10:38:23,470 INFO L226 Difference]: Without dead ends: 330 [2018-11-07 10:38:23,471 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 163 SyntacticMatches, 20 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2277 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1093, Invalid=4759, Unknown=0, NotChecked=0, Total=5852 [2018-11-07 10:38:23,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-11-07 10:38:23,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 128. [2018-11-07 10:38:23,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-11-07 10:38:23,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2018-11-07 10:38:23,584 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 99 [2018-11-07 10:38:23,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:38:23,584 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2018-11-07 10:38:23,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-07 10:38:23,584 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2018-11-07 10:38:23,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-07 10:38:23,585 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:38:23,585 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:38:23,585 INFO L423 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:38:23,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:38:23,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1173773103, now seen corresponding path program 25 times [2018-11-07 10:38:23,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:38:23,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:23,586 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:38:23,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:23,586 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:38:23,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:38:23,850 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 152 proven. 40 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-07 10:38:23,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:38:23,850 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:38:23,850 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:38:23,850 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:38:23,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:38:23,850 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:38:23,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:38:23,860 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:38:23,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:38:23,886 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:38:24,304 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 152 proven. 40 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-07 10:38:24,305 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:38:24,667 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 152 proven. 40 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-07 10:38:24,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:38:24,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 38 [2018-11-07 10:38:24,686 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:38:24,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-07 10:38:24,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-07 10:38:24,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=1137, Unknown=0, NotChecked=0, Total=1406 [2018-11-07 10:38:24,687 INFO L87 Difference]: Start difference. First operand 128 states and 138 transitions. Second operand 38 states. [2018-11-07 10:38:26,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:38:26,227 INFO L93 Difference]: Finished difference Result 421 states and 490 transitions. [2018-11-07 10:38:26,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-07 10:38:26,228 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 99 [2018-11-07 10:38:26,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:38:26,230 INFO L225 Difference]: With dead ends: 421 [2018-11-07 10:38:26,230 INFO L226 Difference]: Without dead ends: 376 [2018-11-07 10:38:26,231 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 164 SyntacticMatches, 20 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2302 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1119, Invalid=4887, Unknown=0, NotChecked=0, Total=6006 [2018-11-07 10:38:26,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2018-11-07 10:38:26,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 128. [2018-11-07 10:38:26,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-11-07 10:38:26,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2018-11-07 10:38:26,353 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 99 [2018-11-07 10:38:26,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:38:26,353 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2018-11-07 10:38:26,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-07 10:38:26,353 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2018-11-07 10:38:26,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-07 10:38:26,354 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:38:26,354 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 6, 5, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:38:26,354 INFO L423 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:38:26,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:38:26,355 INFO L82 PathProgramCache]: Analyzing trace with hash -975971235, now seen corresponding path program 26 times [2018-11-07 10:38:26,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:38:26,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:26,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:38:26,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:26,356 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:38:26,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:38:26,628 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 152 proven. 42 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-07 10:38:26,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:38:26,629 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:38:26,629 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:38:26,629 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:38:26,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:38:26,629 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:38:26,637 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:38:26,638 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:38:26,669 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-07 10:38:26,669 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:38:26,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:38:26,990 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 152 proven. 42 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-07 10:38:26,990 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:38:27,146 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 152 proven. 42 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-07 10:38:27,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:38:27,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 37 [2018-11-07 10:38:27,165 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:38:27,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-07 10:38:27,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-07 10:38:27,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=1074, Unknown=0, NotChecked=0, Total=1332 [2018-11-07 10:38:27,166 INFO L87 Difference]: Start difference. First operand 128 states and 138 transitions. Second operand 37 states. [2018-11-07 10:38:28,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:38:28,731 INFO L93 Difference]: Finished difference Result 465 states and 544 transitions. [2018-11-07 10:38:28,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-07 10:38:28,733 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 99 [2018-11-07 10:38:28,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:38:28,735 INFO L225 Difference]: With dead ends: 465 [2018-11-07 10:38:28,735 INFO L226 Difference]: Without dead ends: 420 [2018-11-07 10:38:28,736 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 165 SyntacticMatches, 20 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2217 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1093, Invalid=4759, Unknown=0, NotChecked=0, Total=5852 [2018-11-07 10:38:28,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2018-11-07 10:38:28,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 128. [2018-11-07 10:38:28,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-11-07 10:38:28,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2018-11-07 10:38:28,930 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 99 [2018-11-07 10:38:28,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:38:28,930 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2018-11-07 10:38:28,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-07 10:38:28,931 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2018-11-07 10:38:28,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-07 10:38:28,932 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:38:28,932 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 7, 6, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:38:28,932 INFO L423 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:38:28,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:38:28,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1717664023, now seen corresponding path program 27 times [2018-11-07 10:38:28,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:38:28,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:28,934 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:38:28,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:28,934 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:38:28,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:38:29,398 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 152 proven. 48 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-07 10:38:29,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:38:29,398 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:38:29,399 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:38:29,399 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:38:29,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:38:29,399 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:38:29,407 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:38:29,408 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:38:29,435 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:38:29,436 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:38:29,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:38:30,047 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 152 proven. 48 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-07 10:38:30,047 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:38:30,203 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 152 proven. 48 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-07 10:38:30,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:38:30,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 36 [2018-11-07 10:38:30,223 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:38:30,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-07 10:38:30,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-07 10:38:30,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=1009, Unknown=0, NotChecked=0, Total=1260 [2018-11-07 10:38:30,224 INFO L87 Difference]: Start difference. First operand 128 states and 138 transitions. Second operand 36 states. [2018-11-07 10:38:31,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:38:31,924 INFO L93 Difference]: Finished difference Result 507 states and 596 transitions. [2018-11-07 10:38:31,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-07 10:38:31,924 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 99 [2018-11-07 10:38:31,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:38:31,926 INFO L225 Difference]: With dead ends: 507 [2018-11-07 10:38:31,926 INFO L226 Difference]: Without dead ends: 462 [2018-11-07 10:38:31,927 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 166 SyntacticMatches, 20 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2019 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1018, Invalid=4384, Unknown=0, NotChecked=0, Total=5402 [2018-11-07 10:38:31,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2018-11-07 10:38:32,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 128. [2018-11-07 10:38:32,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-11-07 10:38:32,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2018-11-07 10:38:32,052 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 99 [2018-11-07 10:38:32,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:38:32,052 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2018-11-07 10:38:32,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-07 10:38:32,052 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2018-11-07 10:38:32,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-07 10:38:32,052 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:38:32,053 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:38:32,053 INFO L423 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:38:32,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:38:32,053 INFO L82 PathProgramCache]: Analyzing trace with hash 283796597, now seen corresponding path program 28 times [2018-11-07 10:38:32,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:38:32,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:32,054 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:38:32,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:32,054 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:38:32,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:38:33,089 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 152 proven. 58 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-07 10:38:33,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:38:33,090 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:38:33,090 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:38:33,090 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:38:33,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:38:33,090 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:38:33,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:38:33,099 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:38:33,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:38:33,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:38:33,391 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 152 proven. 58 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-07 10:38:33,391 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:38:33,546 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 152 proven. 58 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-07 10:38:33,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:38:33,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 35 [2018-11-07 10:38:33,565 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:38:33,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-07 10:38:33,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-07 10:38:33,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=942, Unknown=0, NotChecked=0, Total=1190 [2018-11-07 10:38:33,566 INFO L87 Difference]: Start difference. First operand 128 states and 138 transitions. Second operand 35 states. [2018-11-07 10:38:35,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:38:35,493 INFO L93 Difference]: Finished difference Result 547 states and 646 transitions. [2018-11-07 10:38:35,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-07 10:38:35,493 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 99 [2018-11-07 10:38:35,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:38:35,496 INFO L225 Difference]: With dead ends: 547 [2018-11-07 10:38:35,496 INFO L226 Difference]: Without dead ends: 502 [2018-11-07 10:38:35,497 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 167 SyntacticMatches, 20 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1716 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=903, Invalid=3789, Unknown=0, NotChecked=0, Total=4692 [2018-11-07 10:38:35,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2018-11-07 10:38:35,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 128. [2018-11-07 10:38:35,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-11-07 10:38:35,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2018-11-07 10:38:35,632 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 99 [2018-11-07 10:38:35,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:38:35,632 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2018-11-07 10:38:35,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-07 10:38:35,632 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2018-11-07 10:38:35,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-07 10:38:35,633 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:38:35,633 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:38:35,633 INFO L423 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:38:35,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:38:35,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1885877505, now seen corresponding path program 8 times [2018-11-07 10:38:35,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:38:35,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:35,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:38:35,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:35,634 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:38:35,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:38:36,944 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 152 proven. 72 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-07 10:38:36,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:38:36,945 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:38:36,945 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:38:36,945 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:38:36,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:38:36,945 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:38:36,956 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:38:36,956 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:38:36,989 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-07 10:38:36,989 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:38:36,991 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:38:37,238 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 152 proven. 72 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-07 10:38:37,239 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:38:37,396 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 152 proven. 72 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-07 10:38:37,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:38:37,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 34 [2018-11-07 10:38:37,415 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:38:37,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-07 10:38:37,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-07 10:38:37,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=873, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 10:38:37,416 INFO L87 Difference]: Start difference. First operand 128 states and 138 transitions. Second operand 34 states. [2018-11-07 10:38:39,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:38:39,168 INFO L93 Difference]: Finished difference Result 590 states and 700 transitions. [2018-11-07 10:38:39,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-07 10:38:39,168 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 99 [2018-11-07 10:38:39,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:38:39,171 INFO L225 Difference]: With dead ends: 590 [2018-11-07 10:38:39,171 INFO L226 Difference]: Without dead ends: 545 [2018-11-07 10:38:39,171 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 168 SyntacticMatches, 20 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1328 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=763, Invalid=3019, Unknown=0, NotChecked=0, Total=3782 [2018-11-07 10:38:39,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2018-11-07 10:38:39,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 131. [2018-11-07 10:38:39,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-11-07 10:38:39,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 142 transitions. [2018-11-07 10:38:39,304 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 142 transitions. Word has length 99 [2018-11-07 10:38:39,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:38:39,305 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 142 transitions. [2018-11-07 10:38:39,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-07 10:38:39,305 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 142 transitions. [2018-11-07 10:38:39,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-07 10:38:39,305 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:38:39,306 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:38:39,306 INFO L423 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:38:39,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:38:39,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1743772005, now seen corresponding path program 16 times [2018-11-07 10:38:39,306 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:38:39,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:39,307 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:38:39,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:39,307 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:38:39,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:38:39,552 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 105 proven. 158 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-11-07 10:38:39,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:38:39,553 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:38:39,553 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:38:39,553 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:38:39,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:38:39,553 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:38:39,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:38:39,563 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:38:39,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:38:39,594 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:38:39,836 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 106 proven. 136 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-07 10:38:39,837 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:38:40,055 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 106 proven. 136 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-07 10:38:40,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:38:40,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 17 [2018-11-07 10:38:40,074 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:38:40,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-07 10:38:40,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-07 10:38:40,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2018-11-07 10:38:40,075 INFO L87 Difference]: Start difference. First operand 131 states and 142 transitions. Second operand 17 states. [2018-11-07 10:38:40,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:38:40,401 INFO L93 Difference]: Finished difference Result 141 states and 152 transitions. [2018-11-07 10:38:40,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-07 10:38:40,402 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 101 [2018-11-07 10:38:40,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:38:40,403 INFO L225 Difference]: With dead ends: 141 [2018-11-07 10:38:40,403 INFO L226 Difference]: Without dead ends: 139 [2018-11-07 10:38:40,404 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 192 SyntacticMatches, 19 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2018-11-07 10:38:40,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-11-07 10:38:40,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-11-07 10:38:40,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-11-07 10:38:40,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 150 transitions. [2018-11-07 10:38:40,521 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 150 transitions. Word has length 101 [2018-11-07 10:38:40,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:38:40,521 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 150 transitions. [2018-11-07 10:38:40,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-07 10:38:40,522 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 150 transitions. [2018-11-07 10:38:40,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-07 10:38:40,522 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:38:40,522 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:38:40,522 INFO L423 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:38:40,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:38:40,523 INFO L82 PathProgramCache]: Analyzing trace with hash -860881985, now seen corresponding path program 17 times [2018-11-07 10:38:40,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:38:40,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:40,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:38:40,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:40,523 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:38:40,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:38:43,553 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 189 proven. 90 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 10:38:43,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:38:43,553 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:38:43,553 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:38:43,554 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:38:43,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:38:43,554 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:38:43,562 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:38:43,562 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:38:43,596 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-07 10:38:43,596 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:38:43,599 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:38:44,022 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 189 proven. 90 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 10:38:44,022 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:38:44,274 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 189 proven. 90 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 10:38:44,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:38:44,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 46 [2018-11-07 10:38:44,293 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:38:44,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-11-07 10:38:44,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-07 10:38:44,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=421, Invalid=1649, Unknown=0, NotChecked=0, Total=2070 [2018-11-07 10:38:44,294 INFO L87 Difference]: Start difference. First operand 139 states and 150 transitions. Second operand 46 states. [2018-11-07 10:38:45,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:38:45,278 INFO L93 Difference]: Finished difference Result 248 states and 280 transitions. [2018-11-07 10:38:45,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-07 10:38:45,278 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 109 [2018-11-07 10:38:45,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:38:45,279 INFO L225 Difference]: With dead ends: 248 [2018-11-07 10:38:45,279 INFO L226 Difference]: Without dead ends: 199 [2018-11-07 10:38:45,280 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 176 SyntacticMatches, 22 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2081 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=905, Invalid=3651, Unknown=0, NotChecked=0, Total=4556 [2018-11-07 10:38:45,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-11-07 10:38:45,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 141. [2018-11-07 10:38:45,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-07 10:38:45,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 152 transitions. [2018-11-07 10:38:45,419 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 152 transitions. Word has length 109 [2018-11-07 10:38:45,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:38:45,419 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 152 transitions. [2018-11-07 10:38:45,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-11-07 10:38:45,419 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 152 transitions. [2018-11-07 10:38:45,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-07 10:38:45,420 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:38:45,420 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:38:45,420 INFO L423 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:38:45,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:38:45,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1311238219, now seen corresponding path program 29 times [2018-11-07 10:38:45,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:38:45,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:45,421 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:38:45,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:45,421 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:38:45,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:38:45,799 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 189 proven. 74 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 10:38:45,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:38:45,799 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:38:45,799 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:38:45,799 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:38:45,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:38:45,799 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:38:45,808 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:38:45,808 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:38:45,849 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-07 10:38:45,849 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:38:45,852 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:38:46,280 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 189 proven. 74 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 10:38:46,280 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:38:46,475 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 189 proven. 74 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 10:38:46,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:38:46,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 45 [2018-11-07 10:38:46,495 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:38:46,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-11-07 10:38:46,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-07 10:38:46,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=391, Invalid=1589, Unknown=0, NotChecked=0, Total=1980 [2018-11-07 10:38:46,496 INFO L87 Difference]: Start difference. First operand 141 states and 152 transitions. Second operand 45 states. [2018-11-07 10:38:47,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:38:47,841 INFO L93 Difference]: Finished difference Result 306 states and 349 transitions. [2018-11-07 10:38:47,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-07 10:38:47,841 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 109 [2018-11-07 10:38:47,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:38:47,842 INFO L225 Difference]: With dead ends: 306 [2018-11-07 10:38:47,842 INFO L226 Difference]: Without dead ends: 257 [2018-11-07 10:38:47,843 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 177 SyntacticMatches, 22 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2415 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1081, Invalid=4619, Unknown=0, NotChecked=0, Total=5700 [2018-11-07 10:38:47,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-11-07 10:38:47,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 141. [2018-11-07 10:38:47,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-07 10:38:47,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 152 transitions. [2018-11-07 10:38:47,990 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 152 transitions. Word has length 109 [2018-11-07 10:38:47,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:38:47,990 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 152 transitions. [2018-11-07 10:38:47,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-11-07 10:38:47,991 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 152 transitions. [2018-11-07 10:38:47,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-07 10:38:47,991 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:38:47,991 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 9, 8, 7, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:38:47,992 INFO L423 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:38:47,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:38:47,992 INFO L82 PathProgramCache]: Analyzing trace with hash 562661335, now seen corresponding path program 30 times [2018-11-07 10:38:47,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:38:47,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:47,993 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:38:47,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:47,993 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:38:47,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:38:49,389 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 189 proven. 62 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 10:38:49,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:38:49,389 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:38:49,389 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:38:49,389 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:38:49,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:38:49,390 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:38:49,400 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:38:49,400 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:38:49,428 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:38:49,428 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:38:49,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:38:49,814 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 189 proven. 62 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 10:38:49,815 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:38:50,066 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 189 proven. 62 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 10:38:50,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:38:50,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 44 [2018-11-07 10:38:50,085 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:38:50,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-07 10:38:50,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-07 10:38:50,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=365, Invalid=1527, Unknown=0, NotChecked=0, Total=1892 [2018-11-07 10:38:50,086 INFO L87 Difference]: Start difference. First operand 141 states and 152 transitions. Second operand 44 states. [2018-11-07 10:38:51,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:38:51,817 INFO L93 Difference]: Finished difference Result 362 states and 416 transitions. [2018-11-07 10:38:51,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-07 10:38:51,817 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 109 [2018-11-07 10:38:51,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:38:51,819 INFO L225 Difference]: With dead ends: 362 [2018-11-07 10:38:51,819 INFO L226 Difference]: Without dead ends: 313 [2018-11-07 10:38:51,819 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 178 SyntacticMatches, 22 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2703 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1234, Invalid=5408, Unknown=0, NotChecked=0, Total=6642 [2018-11-07 10:38:51,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-11-07 10:38:52,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 141. [2018-11-07 10:38:52,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-07 10:38:52,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 152 transitions. [2018-11-07 10:38:52,014 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 152 transitions. Word has length 109 [2018-11-07 10:38:52,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:38:52,015 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 152 transitions. [2018-11-07 10:38:52,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-07 10:38:52,015 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 152 transitions. [2018-11-07 10:38:52,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-07 10:38:52,015 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:38:52,016 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 9, 7, 6, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:38:52,016 INFO L423 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:38:52,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:38:52,016 INFO L82 PathProgramCache]: Analyzing trace with hash 195402339, now seen corresponding path program 31 times [2018-11-07 10:38:52,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:38:52,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:52,017 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:38:52,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:52,017 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:38:52,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:38:53,131 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 189 proven. 54 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 10:38:53,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:38:53,132 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:38:53,132 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:38:53,132 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:38:53,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:38:53,132 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:38:53,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:38:53,140 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:38:53,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:38:53,172 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:38:53,661 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 189 proven. 54 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 10:38:53,661 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:38:53,872 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 189 proven. 54 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 10:38:53,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:38:53,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 43 [2018-11-07 10:38:53,892 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:38:53,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-07 10:38:53,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-07 10:38:53,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=343, Invalid=1463, Unknown=0, NotChecked=0, Total=1806 [2018-11-07 10:38:53,893 INFO L87 Difference]: Start difference. First operand 141 states and 152 transitions. Second operand 43 states. [2018-11-07 10:38:55,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:38:55,946 INFO L93 Difference]: Finished difference Result 416 states and 481 transitions. [2018-11-07 10:38:55,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-11-07 10:38:55,946 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 109 [2018-11-07 10:38:55,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:38:55,947 INFO L225 Difference]: With dead ends: 416 [2018-11-07 10:38:55,948 INFO L226 Difference]: Without dead ends: 367 [2018-11-07 10:38:55,949 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 179 SyntacticMatches, 22 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2907 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1346, Invalid=5964, Unknown=0, NotChecked=0, Total=7310 [2018-11-07 10:38:55,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2018-11-07 10:38:56,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 141. [2018-11-07 10:38:56,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-07 10:38:56,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 152 transitions. [2018-11-07 10:38:56,126 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 152 transitions. Word has length 109 [2018-11-07 10:38:56,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:38:56,127 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 152 transitions. [2018-11-07 10:38:56,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-07 10:38:56,127 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 152 transitions. [2018-11-07 10:38:56,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-07 10:38:56,128 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:38:56,128 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 9, 6, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:38:56,128 INFO L423 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:38:56,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:38:56,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1316806639, now seen corresponding path program 32 times [2018-11-07 10:38:56,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:38:56,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:56,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:38:56,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:56,130 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:38:56,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:38:57,344 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 189 proven. 50 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 10:38:57,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:38:57,344 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:38:57,344 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:38:57,344 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:38:57,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:38:57,345 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:38:57,353 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:38:57,353 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:38:57,393 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-07 10:38:57,393 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:38:57,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:38:57,788 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 189 proven. 50 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 10:38:57,788 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:38:57,976 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 189 proven. 50 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 10:38:57,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:38:57,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 42 [2018-11-07 10:38:57,996 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:38:57,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-07 10:38:57,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-07 10:38:57,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=1397, Unknown=0, NotChecked=0, Total=1722 [2018-11-07 10:38:57,997 INFO L87 Difference]: Start difference. First operand 141 states and 152 transitions. Second operand 42 states. [2018-11-07 10:38:59,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:38:59,915 INFO L93 Difference]: Finished difference Result 468 states and 544 transitions. [2018-11-07 10:38:59,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-11-07 10:38:59,915 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 109 [2018-11-07 10:38:59,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:38:59,917 INFO L225 Difference]: With dead ends: 468 [2018-11-07 10:38:59,917 INFO L226 Difference]: Without dead ends: 419 [2018-11-07 10:38:59,918 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 180 SyntacticMatches, 22 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3001 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1405, Invalid=6251, Unknown=0, NotChecked=0, Total=7656 [2018-11-07 10:38:59,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2018-11-07 10:39:00,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 141. [2018-11-07 10:39:00,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-07 10:39:00,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 152 transitions. [2018-11-07 10:39:00,080 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 152 transitions. Word has length 109 [2018-11-07 10:39:00,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:39:00,080 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 152 transitions. [2018-11-07 10:39:00,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-07 10:39:00,080 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 152 transitions. [2018-11-07 10:39:00,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-07 10:39:00,081 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:39:00,081 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 9, 6, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:39:00,081 INFO L423 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:39:00,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:39:00,082 INFO L82 PathProgramCache]: Analyzing trace with hash 893393019, now seen corresponding path program 33 times [2018-11-07 10:39:00,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:39:00,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:39:00,082 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:39:00,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:39:00,083 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:39:00,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:39:00,637 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 189 proven. 50 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 10:39:00,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:39:00,638 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:39:00,638 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:39:00,638 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:39:00,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:39:00,638 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:39:00,648 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:39:00,648 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:39:00,702 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:39:00,702 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:39:00,705 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:39:01,405 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 189 proven. 50 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 10:39:01,406 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:39:01,591 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 189 proven. 50 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 10:39:01,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:39:01,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 41 [2018-11-07 10:39:01,610 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:39:01,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-07 10:39:01,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-07 10:39:01,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=311, Invalid=1329, Unknown=0, NotChecked=0, Total=1640 [2018-11-07 10:39:01,611 INFO L87 Difference]: Start difference. First operand 141 states and 152 transitions. Second operand 41 states. [2018-11-07 10:39:03,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:39:03,794 INFO L93 Difference]: Finished difference Result 518 states and 605 transitions. [2018-11-07 10:39:03,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-11-07 10:39:03,795 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 109 [2018-11-07 10:39:03,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:39:03,797 INFO L225 Difference]: With dead ends: 518 [2018-11-07 10:39:03,797 INFO L226 Difference]: Without dead ends: 469 [2018-11-07 10:39:03,797 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 181 SyntacticMatches, 22 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2971 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1405, Invalid=6251, Unknown=0, NotChecked=0, Total=7656 [2018-11-07 10:39:03,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2018-11-07 10:39:04,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 141. [2018-11-07 10:39:04,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-07 10:39:04,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 152 transitions. [2018-11-07 10:39:04,060 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 152 transitions. Word has length 109 [2018-11-07 10:39:04,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:39:04,060 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 152 transitions. [2018-11-07 10:39:04,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-07 10:39:04,060 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 152 transitions. [2018-11-07 10:39:04,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-07 10:39:04,061 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:39:04,061 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 9, 7, 6, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:39:04,061 INFO L423 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:39:04,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:39:04,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1605368825, now seen corresponding path program 34 times [2018-11-07 10:39:04,062 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:39:04,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:39:04,062 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:39:04,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:39:04,063 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:39:04,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:39:04,462 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 189 proven. 54 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 10:39:04,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:39:04,462 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:39:04,463 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:39:04,463 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:39:04,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:39:04,463 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:39:04,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:39:04,472 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:39:04,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:39:04,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:39:05,880 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 189 proven. 54 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 10:39:05,880 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:39:06,058 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 189 proven. 54 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 10:39:06,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:39:06,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 40 [2018-11-07 10:39:06,078 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:39:06,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-07 10:39:06,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-07 10:39:06,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=1259, Unknown=0, NotChecked=0, Total=1560 [2018-11-07 10:39:06,079 INFO L87 Difference]: Start difference. First operand 141 states and 152 transitions. Second operand 40 states. [2018-11-07 10:39:08,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:39:08,400 INFO L93 Difference]: Finished difference Result 566 states and 664 transitions. [2018-11-07 10:39:08,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-11-07 10:39:08,401 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 109 [2018-11-07 10:39:08,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:39:08,403 INFO L225 Difference]: With dead ends: 566 [2018-11-07 10:39:08,403 INFO L226 Difference]: Without dead ends: 517 [2018-11-07 10:39:08,404 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 182 SyntacticMatches, 22 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2811 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1346, Invalid=5964, Unknown=0, NotChecked=0, Total=7310 [2018-11-07 10:39:08,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2018-11-07 10:39:08,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 141. [2018-11-07 10:39:08,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-07 10:39:08,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 152 transitions. [2018-11-07 10:39:08,579 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 152 transitions. Word has length 109 [2018-11-07 10:39:08,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:39:08,579 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 152 transitions. [2018-11-07 10:39:08,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-07 10:39:08,579 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 152 transitions. [2018-11-07 10:39:08,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-07 10:39:08,580 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:39:08,580 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 9, 8, 7, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:39:08,580 INFO L423 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:39:08,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:39:08,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1858248045, now seen corresponding path program 35 times [2018-11-07 10:39:08,581 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:39:08,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:39:08,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:39:08,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:39:08,581 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:39:08,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:39:09,061 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 189 proven. 62 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 10:39:09,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:39:09,061 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:39:09,061 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:39:09,061 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:39:09,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:39:09,061 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:39:09,070 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:39:09,070 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:39:09,107 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-07 10:39:09,107 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:39:09,110 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:39:09,464 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 189 proven. 62 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 10:39:09,464 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:39:09,646 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 189 proven. 62 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 10:39:09,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:39:09,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 39 [2018-11-07 10:39:09,666 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:39:09,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-07 10:39:09,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-07 10:39:09,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=1187, Unknown=0, NotChecked=0, Total=1482 [2018-11-07 10:39:09,667 INFO L87 Difference]: Start difference. First operand 141 states and 152 transitions. Second operand 39 states. [2018-11-07 10:39:12,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:39:12,131 INFO L93 Difference]: Finished difference Result 612 states and 721 transitions. [2018-11-07 10:39:12,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-11-07 10:39:12,132 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 109 [2018-11-07 10:39:12,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:39:12,134 INFO L225 Difference]: With dead ends: 612 [2018-11-07 10:39:12,135 INFO L226 Difference]: Without dead ends: 563 [2018-11-07 10:39:12,136 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 183 SyntacticMatches, 22 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2523 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1234, Invalid=5408, Unknown=0, NotChecked=0, Total=6642 [2018-11-07 10:39:12,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2018-11-07 10:39:12,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 141. [2018-11-07 10:39:12,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-07 10:39:12,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 152 transitions. [2018-11-07 10:39:12,319 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 152 transitions. Word has length 109 [2018-11-07 10:39:12,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:39:12,319 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 152 transitions. [2018-11-07 10:39:12,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-07 10:39:12,319 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 152 transitions. [2018-11-07 10:39:12,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-07 10:39:12,320 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:39:12,320 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:39:12,320 INFO L423 AbstractCegarLoop]: === Iteration 64 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:39:12,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:39:12,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1228344289, now seen corresponding path program 36 times [2018-11-07 10:39:12,321 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:39:12,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:39:12,321 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:39:12,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:39:12,322 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:39:12,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:39:12,574 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 189 proven. 74 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 10:39:12,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:39:12,574 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:39:12,574 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:39:12,574 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:39:12,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:39:12,575 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:39:12,590 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:39:12,591 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:39:12,641 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:39:12,641 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:39:12,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:39:12,959 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 189 proven. 74 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 10:39:12,959 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:39:13,140 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 189 proven. 74 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 10:39:13,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:39:13,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 38 [2018-11-07 10:39:13,159 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:39:13,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-07 10:39:13,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-07 10:39:13,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=1113, Unknown=0, NotChecked=0, Total=1406 [2018-11-07 10:39:13,160 INFO L87 Difference]: Start difference. First operand 141 states and 152 transitions. Second operand 38 states. [2018-11-07 10:39:15,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:39:15,567 INFO L93 Difference]: Finished difference Result 656 states and 776 transitions. [2018-11-07 10:39:15,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-11-07 10:39:15,567 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 109 [2018-11-07 10:39:15,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:39:15,570 INFO L225 Difference]: With dead ends: 656 [2018-11-07 10:39:15,570 INFO L226 Difference]: Without dead ends: 607 [2018-11-07 10:39:15,571 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 184 SyntacticMatches, 22 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2121 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1081, Invalid=4619, Unknown=0, NotChecked=0, Total=5700 [2018-11-07 10:39:15,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2018-11-07 10:39:15,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 141. [2018-11-07 10:39:15,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-07 10:39:15,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 152 transitions. [2018-11-07 10:39:15,752 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 152 transitions. Word has length 109 [2018-11-07 10:39:15,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:39:15,753 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 152 transitions. [2018-11-07 10:39:15,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-07 10:39:15,753 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 152 transitions. [2018-11-07 10:39:15,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-07 10:39:15,754 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:39:15,754 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:39:15,754 INFO L423 AbstractCegarLoop]: === Iteration 65 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:39:15,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:39:15,754 INFO L82 PathProgramCache]: Analyzing trace with hash -119310165, now seen corresponding path program 9 times [2018-11-07 10:39:15,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:39:15,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:39:15,755 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:39:15,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:39:15,755 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:39:15,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:39:16,091 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 189 proven. 90 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 10:39:16,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:39:16,091 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:39:16,091 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:39:16,091 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:39:16,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:39:16,091 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:39:16,103 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:39:16,103 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:39:16,130 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:39:16,131 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:39:16,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:39:16,438 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 189 proven. 90 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 10:39:16,438 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:39:16,632 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 189 proven. 90 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 10:39:16,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:39:16,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 37 [2018-11-07 10:39:16,651 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:39:16,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-07 10:39:16,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-07 10:39:16,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=1037, Unknown=0, NotChecked=0, Total=1332 [2018-11-07 10:39:16,652 INFO L87 Difference]: Start difference. First operand 141 states and 152 transitions. Second operand 37 states. [2018-11-07 10:39:18,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:39:18,979 INFO L93 Difference]: Finished difference Result 703 states and 835 transitions. [2018-11-07 10:39:18,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-07 10:39:18,986 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 109 [2018-11-07 10:39:18,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:39:18,989 INFO L225 Difference]: With dead ends: 703 [2018-11-07 10:39:18,989 INFO L226 Difference]: Without dead ends: 654 [2018-11-07 10:39:18,990 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 185 SyntacticMatches, 22 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1631 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=905, Invalid=3651, Unknown=0, NotChecked=0, Total=4556 [2018-11-07 10:39:18,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2018-11-07 10:39:19,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 144. [2018-11-07 10:39:19,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-11-07 10:39:19,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 156 transitions. [2018-11-07 10:39:19,184 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 156 transitions. Word has length 109 [2018-11-07 10:39:19,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:39:19,184 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 156 transitions. [2018-11-07 10:39:19,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-07 10:39:19,184 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 156 transitions. [2018-11-07 10:39:19,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-07 10:39:19,185 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:39:19,185 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:39:19,185 INFO L423 AbstractCegarLoop]: === Iteration 66 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:39:19,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:39:19,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1752486599, now seen corresponding path program 18 times [2018-11-07 10:39:19,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:39:19,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:39:19,186 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:39:19,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:39:19,186 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:39:19,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:39:19,330 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 127 proven. 196 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-11-07 10:39:19,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:39:19,330 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:39:19,331 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:39:19,331 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:39:19,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:39:19,331 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:39:19,340 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:39:19,340 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:39:19,373 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:39:19,373 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:39:19,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:39:19,424 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 128 proven. 171 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 10:39:19,424 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:39:19,546 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 128 proven. 171 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 10:39:19,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:39:19,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 18 [2018-11-07 10:39:19,565 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:39:19,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 10:39:19,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 10:39:19,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2018-11-07 10:39:19,566 INFO L87 Difference]: Start difference. First operand 144 states and 156 transitions. Second operand 18 states. [2018-11-07 10:39:20,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:39:20,049 INFO L93 Difference]: Finished difference Result 154 states and 166 transitions. [2018-11-07 10:39:20,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 10:39:20,050 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 111 [2018-11-07 10:39:20,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:39:20,051 INFO L225 Difference]: With dead ends: 154 [2018-11-07 10:39:20,051 INFO L226 Difference]: Without dead ends: 152 [2018-11-07 10:39:20,052 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 211 SyntacticMatches, 21 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2018-11-07 10:39:20,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-11-07 10:39:20,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-11-07 10:39:20,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-11-07 10:39:20,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 164 transitions. [2018-11-07 10:39:20,236 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 164 transitions. Word has length 111 [2018-11-07 10:39:20,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:39:20,236 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 164 transitions. [2018-11-07 10:39:20,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 10:39:20,237 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 164 transitions. [2018-11-07 10:39:20,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-07 10:39:20,237 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:39:20,237 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:39:20,237 INFO L423 AbstractCegarLoop]: === Iteration 67 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:39:20,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:39:20,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1040286813, now seen corresponding path program 19 times [2018-11-07 10:39:20,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:39:20,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:39:20,238 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:39:20,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:39:20,238 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:39:20,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:39:20,524 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 230 proven. 110 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-07 10:39:20,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:39:20,524 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:39:20,525 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:39:20,525 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:39:20,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:39:20,525 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:39:20,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:39:20,534 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:39:20,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:39:20,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:39:21,406 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 230 proven. 110 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-07 10:39:21,406 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:39:21,635 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 230 proven. 110 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-07 10:39:21,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:39:21,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 50 [2018-11-07 10:39:21,655 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:39:21,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-11-07 10:39:21,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-11-07 10:39:21,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=495, Invalid=1955, Unknown=0, NotChecked=0, Total=2450 [2018-11-07 10:39:21,657 INFO L87 Difference]: Start difference. First operand 152 states and 164 transitions. Second operand 50 states. [2018-11-07 10:39:22,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:39:22,891 INFO L93 Difference]: Finished difference Result 271 states and 306 transitions. [2018-11-07 10:39:22,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-07 10:39:22,892 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 119 [2018-11-07 10:39:22,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:39:22,893 INFO L225 Difference]: With dead ends: 271 [2018-11-07 10:39:22,893 INFO L226 Difference]: Without dead ends: 218 [2018-11-07 10:39:22,893 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 192 SyntacticMatches, 24 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2515 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1059, Invalid=4343, Unknown=0, NotChecked=0, Total=5402 [2018-11-07 10:39:22,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-11-07 10:39:23,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 154. [2018-11-07 10:39:23,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-11-07 10:39:23,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 166 transitions. [2018-11-07 10:39:23,109 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 166 transitions. Word has length 119 [2018-11-07 10:39:23,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:39:23,109 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 166 transitions. [2018-11-07 10:39:23,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-11-07 10:39:23,109 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 166 transitions. [2018-11-07 10:39:23,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-07 10:39:23,110 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:39:23,110 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:39:23,110 INFO L423 AbstractCegarLoop]: === Iteration 68 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:39:23,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:39:23,110 INFO L82 PathProgramCache]: Analyzing trace with hash -661376535, now seen corresponding path program 37 times [2018-11-07 10:39:23,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:39:23,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:39:23,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:39:23,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:39:23,111 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:39:23,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:39:23,407 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 230 proven. 92 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-07 10:39:23,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:39:23,408 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:39:23,408 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:39:23,408 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:39:23,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:39:23,408 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:39:23,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:39:23,417 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:39:23,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:39:23,451 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:39:23,910 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 230 proven. 92 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-07 10:39:23,910 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:39:24,244 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 230 proven. 92 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-07 10:39:24,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:39:24,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 49 [2018-11-07 10:39:24,263 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:39:24,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-11-07 10:39:24,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-11-07 10:39:24,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=462, Invalid=1890, Unknown=0, NotChecked=0, Total=2352 [2018-11-07 10:39:24,264 INFO L87 Difference]: Start difference. First operand 154 states and 166 transitions. Second operand 49 states. [2018-11-07 10:39:26,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:39:26,016 INFO L93 Difference]: Finished difference Result 335 states and 382 transitions. [2018-11-07 10:39:26,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-07 10:39:26,016 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 119 [2018-11-07 10:39:26,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:39:26,017 INFO L225 Difference]: With dead ends: 335 [2018-11-07 10:39:26,017 INFO L226 Difference]: Without dead ends: 282 [2018-11-07 10:39:26,018 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 193 SyntacticMatches, 24 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2937 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1275, Invalid=5531, Unknown=0, NotChecked=0, Total=6806 [2018-11-07 10:39:26,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-11-07 10:39:26,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 154. [2018-11-07 10:39:26,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-11-07 10:39:26,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 166 transitions. [2018-11-07 10:39:26,244 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 166 transitions. Word has length 119 [2018-11-07 10:39:26,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:39:26,245 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 166 transitions. [2018-11-07 10:39:26,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-11-07 10:39:26,245 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 166 transitions. [2018-11-07 10:39:26,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-07 10:39:26,245 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:39:26,246 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 9, 8, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:39:26,246 INFO L423 AbstractCegarLoop]: === Iteration 69 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:39:26,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:39:26,246 INFO L82 PathProgramCache]: Analyzing trace with hash 516739701, now seen corresponding path program 38 times [2018-11-07 10:39:26,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:39:26,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:39:26,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:39:26,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:39:26,247 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:39:26,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:39:26,590 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 230 proven. 78 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-07 10:39:26,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:39:26,590 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:39:26,590 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:39:26,591 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:39:26,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:39:26,591 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:39:26,598 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:39:26,599 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:39:26,634 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-07 10:39:26,634 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:39:26,636 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:39:27,155 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 230 proven. 78 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-07 10:39:27,156 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:39:27,386 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 230 proven. 78 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-07 10:39:27,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:39:27,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 48 [2018-11-07 10:39:27,405 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:39:27,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-07 10:39:27,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-07 10:39:27,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=433, Invalid=1823, Unknown=0, NotChecked=0, Total=2256 [2018-11-07 10:39:27,406 INFO L87 Difference]: Start difference. First operand 154 states and 166 transitions. Second operand 48 states. [2018-11-07 10:39:29,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:39:29,430 INFO L93 Difference]: Finished difference Result 397 states and 456 transitions. [2018-11-07 10:39:29,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-07 10:39:29,431 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 119 [2018-11-07 10:39:29,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:39:29,432 INFO L225 Difference]: With dead ends: 397 [2018-11-07 10:39:29,432 INFO L226 Difference]: Without dead ends: 344 [2018-11-07 10:39:29,433 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 194 SyntacticMatches, 24 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3318 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1471, Invalid=6539, Unknown=0, NotChecked=0, Total=8010 [2018-11-07 10:39:29,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-11-07 10:39:29,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 154. [2018-11-07 10:39:29,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-11-07 10:39:29,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 166 transitions. [2018-11-07 10:39:29,642 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 166 transitions. Word has length 119 [2018-11-07 10:39:29,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:39:29,642 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 166 transitions. [2018-11-07 10:39:29,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-07 10:39:29,643 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 166 transitions. [2018-11-07 10:39:29,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-07 10:39:29,643 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:39:29,643 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 8, 7, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:39:29,643 INFO L423 AbstractCegarLoop]: === Iteration 70 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:39:29,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:39:29,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1752422911, now seen corresponding path program 39 times [2018-11-07 10:39:29,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:39:29,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:39:29,644 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:39:29,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:39:29,644 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:39:29,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:39:29,920 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 230 proven. 68 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-07 10:39:29,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:39:29,920 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:39:29,920 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:39:29,921 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:39:29,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:39:29,921 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:39:29,929 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:39:29,929 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:39:29,961 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:39:29,961 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:39:29,964 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:39:30,650 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 230 proven. 68 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-07 10:39:30,650 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:39:30,903 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 230 proven. 68 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-07 10:39:30,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:39:30,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 47 [2018-11-07 10:39:30,925 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:39:30,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-11-07 10:39:30,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-11-07 10:39:30,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=408, Invalid=1754, Unknown=0, NotChecked=0, Total=2162 [2018-11-07 10:39:30,925 INFO L87 Difference]: Start difference. First operand 154 states and 166 transitions. Second operand 47 states. [2018-11-07 10:39:33,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:39:33,590 INFO L93 Difference]: Finished difference Result 457 states and 528 transitions. [2018-11-07 10:39:33,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-11-07 10:39:33,590 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 119 [2018-11-07 10:39:33,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:39:33,592 INFO L225 Difference]: With dead ends: 457 [2018-11-07 10:39:33,592 INFO L226 Difference]: Without dead ends: 404 [2018-11-07 10:39:33,593 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 195 SyntacticMatches, 24 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3614 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1626, Invalid=7304, Unknown=0, NotChecked=0, Total=8930 [2018-11-07 10:39:33,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2018-11-07 10:39:33,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 154. [2018-11-07 10:39:33,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-11-07 10:39:33,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 166 transitions. [2018-11-07 10:39:33,821 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 166 transitions. Word has length 119 [2018-11-07 10:39:33,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:39:33,822 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 166 transitions. [2018-11-07 10:39:33,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-11-07 10:39:33,822 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 166 transitions. [2018-11-07 10:39:33,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-07 10:39:33,822 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:39:33,822 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 7, 6, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:39:33,822 INFO L423 AbstractCegarLoop]: === Iteration 71 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:39:33,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:39:33,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1964839795, now seen corresponding path program 40 times [2018-11-07 10:39:33,823 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:39:33,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:39:33,823 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:39:33,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:39:33,824 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:39:33,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:39:34,108 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 230 proven. 62 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-07 10:39:34,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:39:34,108 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:39:34,108 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:39:34,109 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:39:34,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:39:34,109 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:39:34,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:39:34,116 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:39:34,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:39:34,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:39:35,263 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 230 proven. 62 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-07 10:39:35,263 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:39:35,497 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 230 proven. 62 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-07 10:39:35,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:39:35,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 46 [2018-11-07 10:39:35,517 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:39:35,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-11-07 10:39:35,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-07 10:39:35,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=387, Invalid=1683, Unknown=0, NotChecked=0, Total=2070 [2018-11-07 10:39:35,518 INFO L87 Difference]: Start difference. First operand 154 states and 166 transitions. Second operand 46 states. [2018-11-07 10:39:38,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:39:38,439 INFO L93 Difference]: Finished difference Result 515 states and 598 transitions. [2018-11-07 10:39:38,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-11-07 10:39:38,439 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 119 [2018-11-07 10:39:38,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:39:38,442 INFO L225 Difference]: With dead ends: 515 [2018-11-07 10:39:38,442 INFO L226 Difference]: Without dead ends: 462 [2018-11-07 10:39:38,443 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 196 SyntacticMatches, 24 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3793 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1725, Invalid=7781, Unknown=0, NotChecked=0, Total=9506 [2018-11-07 10:39:38,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2018-11-07 10:39:38,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 154. [2018-11-07 10:39:38,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-11-07 10:39:38,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 166 transitions. [2018-11-07 10:39:38,678 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 166 transitions. Word has length 119 [2018-11-07 10:39:38,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:39:38,678 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 166 transitions. [2018-11-07 10:39:38,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-11-07 10:39:38,678 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 166 transitions. [2018-11-07 10:39:38,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-07 10:39:38,679 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:39:38,679 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:39:38,679 INFO L423 AbstractCegarLoop]: === Iteration 72 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:39:38,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:39:38,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1911429607, now seen corresponding path program 41 times [2018-11-07 10:39:38,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:39:38,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:39:38,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:39:38,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:39:38,681 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:39:38,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:39:39,088 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 230 proven. 60 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-07 10:39:39,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:39:39,088 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:39:39,088 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:39:39,089 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:39:39,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:39:39,089 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:39:39,106 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:39:39,106 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:39:39,199 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-07 10:39:39,199 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:39:39,201 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:39:39,883 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 230 proven. 60 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-07 10:39:39,883 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:39:40,106 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 230 proven. 60 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-07 10:39:40,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:39:40,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 45 [2018-11-07 10:39:40,127 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:39:40,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-11-07 10:39:40,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-07 10:39:40,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=1610, Unknown=0, NotChecked=0, Total=1980 [2018-11-07 10:39:40,128 INFO L87 Difference]: Start difference. First operand 154 states and 166 transitions. Second operand 45 states. [2018-11-07 10:39:43,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:39:43,207 INFO L93 Difference]: Finished difference Result 571 states and 666 transitions. [2018-11-07 10:39:43,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-11-07 10:39:43,207 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 119 [2018-11-07 10:39:43,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:39:43,210 INFO L225 Difference]: With dead ends: 571 [2018-11-07 10:39:43,210 INFO L226 Difference]: Without dead ends: 518 [2018-11-07 10:39:43,212 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 197 SyntacticMatches, 24 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3835 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1759, Invalid=7943, Unknown=0, NotChecked=0, Total=9702 [2018-11-07 10:39:43,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2018-11-07 10:39:43,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 154. [2018-11-07 10:39:43,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-11-07 10:39:43,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 166 transitions. [2018-11-07 10:39:43,463 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 166 transitions. Word has length 119 [2018-11-07 10:39:43,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:39:43,463 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 166 transitions. [2018-11-07 10:39:43,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-11-07 10:39:43,463 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 166 transitions. [2018-11-07 10:39:43,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-07 10:39:43,464 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:39:43,464 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 7, 6, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:39:43,464 INFO L423 AbstractCegarLoop]: === Iteration 73 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:39:43,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:39:43,464 INFO L82 PathProgramCache]: Analyzing trace with hash 260690597, now seen corresponding path program 42 times [2018-11-07 10:39:43,465 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:39:43,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:39:43,465 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:39:43,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:39:43,465 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:39:43,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:39:43,895 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 230 proven. 62 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-07 10:39:43,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:39:43,895 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:39:43,895 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:39:43,895 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:39:43,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:39:43,896 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:39:43,904 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:39:43,904 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:39:43,937 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:39:43,937 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:39:43,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:39:44,327 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 230 proven. 62 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-07 10:39:44,328 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:39:44,539 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 230 proven. 62 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-07 10:39:44,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:39:44,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 44 [2018-11-07 10:39:44,558 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:39:44,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-07 10:39:44,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-07 10:39:44,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=1535, Unknown=0, NotChecked=0, Total=1892 [2018-11-07 10:39:44,559 INFO L87 Difference]: Start difference. First operand 154 states and 166 transitions. Second operand 44 states. [2018-11-07 10:39:47,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:39:47,699 INFO L93 Difference]: Finished difference Result 625 states and 732 transitions. [2018-11-07 10:39:47,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-11-07 10:39:47,699 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 119 [2018-11-07 10:39:47,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:39:47,701 INFO L225 Difference]: With dead ends: 625 [2018-11-07 10:39:47,702 INFO L226 Difference]: Without dead ends: 572 [2018-11-07 10:39:47,703 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 198 SyntacticMatches, 24 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3731 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1725, Invalid=7781, Unknown=0, NotChecked=0, Total=9506 [2018-11-07 10:39:47,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2018-11-07 10:39:47,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 154. [2018-11-07 10:39:47,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-11-07 10:39:47,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 166 transitions. [2018-11-07 10:39:47,986 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 166 transitions. Word has length 119 [2018-11-07 10:39:47,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:39:47,986 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 166 transitions. [2018-11-07 10:39:47,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-07 10:39:47,986 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 166 transitions. [2018-11-07 10:39:47,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-07 10:39:47,987 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:39:47,987 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 8, 7, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:39:47,987 INFO L423 AbstractCegarLoop]: === Iteration 74 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:39:47,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:39:47,988 INFO L82 PathProgramCache]: Analyzing trace with hash -487886287, now seen corresponding path program 43 times [2018-11-07 10:39:47,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:39:47,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:39:47,988 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:39:47,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:39:47,988 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:39:47,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:39:48,255 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 230 proven. 68 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-07 10:39:48,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:39:48,255 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:39:48,255 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:39:48,255 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:39:48,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:39:48,256 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:39:48,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:39:48,263 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:39:48,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:39:48,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:39:48,668 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 230 proven. 68 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-07 10:39:48,668 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:39:48,892 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 230 proven. 68 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-07 10:39:48,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:39:48,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 43 [2018-11-07 10:39:48,911 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:39:48,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-07 10:39:48,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-07 10:39:48,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=348, Invalid=1458, Unknown=0, NotChecked=0, Total=1806 [2018-11-07 10:39:48,912 INFO L87 Difference]: Start difference. First operand 154 states and 166 transitions. Second operand 43 states. [2018-11-07 10:39:52,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:39:52,277 INFO L93 Difference]: Finished difference Result 677 states and 796 transitions. [2018-11-07 10:39:52,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-11-07 10:39:52,277 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 119 [2018-11-07 10:39:52,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:39:52,280 INFO L225 Difference]: With dead ends: 677 [2018-11-07 10:39:52,280 INFO L226 Difference]: Without dead ends: 624 [2018-11-07 10:39:52,280 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 199 SyntacticMatches, 24 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3478 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1626, Invalid=7304, Unknown=0, NotChecked=0, Total=8930 [2018-11-07 10:39:52,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2018-11-07 10:39:52,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 154. [2018-11-07 10:39:52,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-11-07 10:39:52,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 166 transitions. [2018-11-07 10:39:52,544 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 166 transitions. Word has length 119 [2018-11-07 10:39:52,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:39:52,544 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 166 transitions. [2018-11-07 10:39:52,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-07 10:39:52,544 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 166 transitions. [2018-11-07 10:39:52,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-07 10:39:52,545 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:39:52,545 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 9, 8, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:39:52,545 INFO L423 AbstractCegarLoop]: === Iteration 75 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:39:52,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:39:52,546 INFO L82 PathProgramCache]: Analyzing trace with hash -855145283, now seen corresponding path program 44 times [2018-11-07 10:39:52,546 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:39:52,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:39:52,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:39:52,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:39:52,547 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:39:52,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:39:52,866 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 230 proven. 78 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-07 10:39:52,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:39:52,866 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:39:52,866 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:39:52,866 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:39:52,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:39:52,866 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:39:52,876 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:39:52,876 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:39:52,915 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-07 10:39:52,915 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:39:52,918 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:39:53,281 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 230 proven. 78 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-07 10:39:53,281 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:39:53,511 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 230 proven. 78 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-07 10:39:53,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:39:53,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 42 [2018-11-07 10:39:53,532 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:39:53,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-07 10:39:53,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-07 10:39:53,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=343, Invalid=1379, Unknown=0, NotChecked=0, Total=1722 [2018-11-07 10:39:53,533 INFO L87 Difference]: Start difference. First operand 154 states and 166 transitions. Second operand 42 states. [2018-11-07 10:39:56,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:39:56,959 INFO L93 Difference]: Finished difference Result 727 states and 858 transitions. [2018-11-07 10:39:56,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-11-07 10:39:56,960 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 119 [2018-11-07 10:39:56,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:39:56,963 INFO L225 Difference]: With dead ends: 727 [2018-11-07 10:39:56,963 INFO L226 Difference]: Without dead ends: 674 [2018-11-07 10:39:56,964 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 200 SyntacticMatches, 24 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3084 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1471, Invalid=6539, Unknown=0, NotChecked=0, Total=8010 [2018-11-07 10:39:56,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2018-11-07 10:39:57,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 154. [2018-11-07 10:39:57,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-11-07 10:39:57,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 166 transitions. [2018-11-07 10:39:57,234 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 166 transitions. Word has length 119 [2018-11-07 10:39:57,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:39:57,234 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 166 transitions. [2018-11-07 10:39:57,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-07 10:39:57,234 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 166 transitions. [2018-11-07 10:39:57,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-07 10:39:57,235 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:39:57,235 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:39:57,235 INFO L423 AbstractCegarLoop]: === Iteration 76 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:39:57,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:39:57,235 INFO L82 PathProgramCache]: Analyzing trace with hash 266259017, now seen corresponding path program 45 times [2018-11-07 10:39:57,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:39:57,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:39:57,236 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:39:57,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:39:57,236 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:39:57,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:39:57,513 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 230 proven. 92 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-07 10:39:57,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:39:57,514 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:39:57,514 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:39:57,514 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:39:57,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:39:57,514 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:39:57,522 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:39:57,523 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:39:57,553 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:39:57,553 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:39:57,555 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:39:57,955 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 230 proven. 92 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-07 10:39:57,955 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:39:58,826 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 230 proven. 92 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-07 10:39:58,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:39:58,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 41 [2018-11-07 10:39:58,846 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:39:58,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-07 10:39:58,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-07 10:39:58,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=342, Invalid=1298, Unknown=0, NotChecked=0, Total=1640 [2018-11-07 10:39:58,847 INFO L87 Difference]: Start difference. First operand 154 states and 166 transitions. Second operand 41 states. [2018-11-07 10:40:02,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:40:02,119 INFO L93 Difference]: Finished difference Result 775 states and 918 transitions. [2018-11-07 10:40:02,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-11-07 10:40:02,119 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 119 [2018-11-07 10:40:02,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:40:02,122 INFO L225 Difference]: With dead ends: 775 [2018-11-07 10:40:02,122 INFO L226 Difference]: Without dead ends: 722 [2018-11-07 10:40:02,123 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 201 SyntacticMatches, 24 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2569 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1275, Invalid=5531, Unknown=0, NotChecked=0, Total=6806 [2018-11-07 10:40:02,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2018-11-07 10:40:02,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 154. [2018-11-07 10:40:02,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-11-07 10:40:02,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 166 transitions. [2018-11-07 10:40:02,375 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 166 transitions. Word has length 119 [2018-11-07 10:40:02,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:40:02,375 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 166 transitions. [2018-11-07 10:40:02,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-07 10:40:02,375 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 166 transitions. [2018-11-07 10:40:02,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-07 10:40:02,375 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:40:02,376 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:40:02,376 INFO L423 AbstractCegarLoop]: === Iteration 77 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:40:02,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:02,376 INFO L82 PathProgramCache]: Analyzing trace with hash -157154603, now seen corresponding path program 10 times [2018-11-07 10:40:02,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:40:02,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:02,376 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:40:02,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:02,377 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:40:02,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:02,772 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 230 proven. 110 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-07 10:40:02,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:02,772 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:40:02,773 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:40:02,773 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:40:02,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:02,773 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:40:02,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:40:02,783 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:40:02,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:02,817 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:40:03,153 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 230 proven. 110 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-07 10:40:03,153 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:40:03,365 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 230 proven. 110 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-07 10:40:03,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:40:03,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 40 [2018-11-07 10:40:03,384 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:40:03,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-07 10:40:03,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-07 10:40:03,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=345, Invalid=1215, Unknown=0, NotChecked=0, Total=1560 [2018-11-07 10:40:03,385 INFO L87 Difference]: Start difference. First operand 154 states and 166 transitions. Second operand 40 states. [2018-11-07 10:40:06,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:40:06,702 INFO L93 Difference]: Finished difference Result 826 states and 982 transitions. [2018-11-07 10:40:06,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-07 10:40:06,702 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 119 [2018-11-07 10:40:06,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:40:06,705 INFO L225 Difference]: With dead ends: 826 [2018-11-07 10:40:06,705 INFO L226 Difference]: Without dead ends: 773 [2018-11-07 10:40:06,705 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 202 SyntacticMatches, 24 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1965 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1059, Invalid=4343, Unknown=0, NotChecked=0, Total=5402 [2018-11-07 10:40:06,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2018-11-07 10:40:06,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 157. [2018-11-07 10:40:06,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-11-07 10:40:06,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 170 transitions. [2018-11-07 10:40:06,982 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 170 transitions. Word has length 119 [2018-11-07 10:40:06,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:40:06,982 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 170 transitions. [2018-11-07 10:40:06,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-07 10:40:06,983 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 170 transitions. [2018-11-07 10:40:06,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-07 10:40:06,983 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:40:06,983 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:40:06,983 INFO L423 AbstractCegarLoop]: === Iteration 78 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:40:06,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:06,984 INFO L82 PathProgramCache]: Analyzing trace with hash 777037143, now seen corresponding path program 20 times [2018-11-07 10:40:06,984 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:40:06,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:06,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:40:06,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:06,984 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:40:06,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:07,303 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 151 proven. 238 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-11-07 10:40:07,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:07,304 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:40:07,304 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:40:07,304 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:40:07,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:07,304 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:40:07,312 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:40:07,312 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:40:07,352 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-07 10:40:07,353 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:40:07,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:40:07,395 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 152 proven. 210 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-07 10:40:07,395 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:40:07,544 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 152 proven. 210 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-07 10:40:07,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:40:07,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 19 [2018-11-07 10:40:07,563 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:40:07,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-07 10:40:07,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-07 10:40:07,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2018-11-07 10:40:07,564 INFO L87 Difference]: Start difference. First operand 157 states and 170 transitions. Second operand 19 states. [2018-11-07 10:40:08,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:40:08,156 INFO L93 Difference]: Finished difference Result 167 states and 180 transitions. [2018-11-07 10:40:08,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-07 10:40:08,157 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 121 [2018-11-07 10:40:08,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:40:08,157 INFO L225 Difference]: With dead ends: 167 [2018-11-07 10:40:08,157 INFO L226 Difference]: Without dead ends: 165 [2018-11-07 10:40:08,158 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 230 SyntacticMatches, 23 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2018-11-07 10:40:08,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-11-07 10:40:08,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-11-07 10:40:08,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-11-07 10:40:08,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 178 transitions. [2018-11-07 10:40:08,415 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 178 transitions. Word has length 121 [2018-11-07 10:40:08,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:40:08,415 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 178 transitions. [2018-11-07 10:40:08,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-07 10:40:08,416 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 178 transitions. [2018-11-07 10:40:08,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-07 10:40:08,416 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:40:08,416 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:40:08,416 INFO L423 AbstractCegarLoop]: === Iteration 79 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:40:08,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:08,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1277952389, now seen corresponding path program 21 times [2018-11-07 10:40:08,417 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:40:08,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:08,417 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:40:08,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:08,417 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:40:08,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:08,758 INFO L134 CoverageAnalysis]: Checked inductivity of 627 backedges. 275 proven. 132 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 10:40:08,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:08,758 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:40:08,758 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:40:08,758 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:40:08,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:08,759 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:40:08,767 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:40:08,767 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:40:08,798 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:40:08,798 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:40:08,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:40:09,377 INFO L134 CoverageAnalysis]: Checked inductivity of 627 backedges. 275 proven. 132 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 10:40:09,377 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:40:09,669 INFO L134 CoverageAnalysis]: Checked inductivity of 627 backedges. 275 proven. 132 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 10:40:09,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:40:09,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 54 [2018-11-07 10:40:09,689 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:40:09,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-11-07 10:40:09,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-11-07 10:40:09,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=575, Invalid=2287, Unknown=0, NotChecked=0, Total=2862 [2018-11-07 10:40:09,690 INFO L87 Difference]: Start difference. First operand 165 states and 178 transitions. Second operand 54 states. [2018-11-07 10:40:11,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:40:11,516 INFO L93 Difference]: Finished difference Result 294 states and 332 transitions. [2018-11-07 10:40:11,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-07 10:40:11,517 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 129 [2018-11-07 10:40:11,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:40:11,518 INFO L225 Difference]: With dead ends: 294 [2018-11-07 10:40:11,518 INFO L226 Difference]: Without dead ends: 237 [2018-11-07 10:40:11,519 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 208 SyntacticMatches, 26 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2990 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1225, Invalid=5095, Unknown=0, NotChecked=0, Total=6320 [2018-11-07 10:40:11,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-11-07 10:40:11,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 167. [2018-11-07 10:40:11,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-11-07 10:40:11,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 180 transitions. [2018-11-07 10:40:11,829 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 180 transitions. Word has length 129 [2018-11-07 10:40:11,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:40:11,830 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 180 transitions. [2018-11-07 10:40:11,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-11-07 10:40:11,830 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 180 transitions. [2018-11-07 10:40:11,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-07 10:40:11,830 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:40:11,830 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:40:11,831 INFO L423 AbstractCegarLoop]: === Iteration 80 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:40:11,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:11,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1178325753, now seen corresponding path program 46 times [2018-11-07 10:40:11,831 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:40:11,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:11,832 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:40:11,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:11,832 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:40:11,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:12,364 INFO L134 CoverageAnalysis]: Checked inductivity of 607 backedges. 275 proven. 112 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 10:40:12,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:12,364 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:40:12,364 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:40:12,364 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:40:12,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:12,364 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:40:12,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:40:12,373 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:40:12,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:12,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:40:12,982 INFO L134 CoverageAnalysis]: Checked inductivity of 607 backedges. 275 proven. 112 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 10:40:12,983 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:40:13,239 INFO L134 CoverageAnalysis]: Checked inductivity of 607 backedges. 275 proven. 112 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 10:40:13,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:40:13,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 53 [2018-11-07 10:40:13,258 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:40:13,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-11-07 10:40:13,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-11-07 10:40:13,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=539, Invalid=2217, Unknown=0, NotChecked=0, Total=2756 [2018-11-07 10:40:13,259 INFO L87 Difference]: Start difference. First operand 167 states and 180 transitions. Second operand 53 states. [2018-11-07 10:40:15,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:40:15,622 INFO L93 Difference]: Finished difference Result 364 states and 415 transitions. [2018-11-07 10:40:15,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-07 10:40:15,622 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 129 [2018-11-07 10:40:15,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:40:15,624 INFO L225 Difference]: With dead ends: 364 [2018-11-07 10:40:15,624 INFO L226 Difference]: Without dead ends: 307 [2018-11-07 10:40:15,625 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 209 SyntacticMatches, 26 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3510 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1485, Invalid=6525, Unknown=0, NotChecked=0, Total=8010 [2018-11-07 10:40:15,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-11-07 10:40:15,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 167. [2018-11-07 10:40:15,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-11-07 10:40:15,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 180 transitions. [2018-11-07 10:40:15,935 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 180 transitions. Word has length 129 [2018-11-07 10:40:15,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:40:15,935 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 180 transitions. [2018-11-07 10:40:15,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-11-07 10:40:15,936 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 180 transitions. [2018-11-07 10:40:15,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-07 10:40:15,936 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:40:15,936 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 11, 10, 9, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:40:15,937 INFO L423 AbstractCegarLoop]: === Iteration 81 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:40:15,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:15,937 INFO L82 PathProgramCache]: Analyzing trace with hash -154759533, now seen corresponding path program 47 times [2018-11-07 10:40:15,937 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:40:15,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:15,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:40:15,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:15,937 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:40:15,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:16,272 INFO L134 CoverageAnalysis]: Checked inductivity of 591 backedges. 275 proven. 96 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 10:40:16,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:16,272 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:40:16,272 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:40:16,272 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:40:16,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:16,272 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:40:16,281 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:40:16,281 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:40:16,319 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-07 10:40:16,319 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:40:16,322 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:40:16,833 INFO L134 CoverageAnalysis]: Checked inductivity of 591 backedges. 275 proven. 96 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 10:40:16,833 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:40:17,360 INFO L134 CoverageAnalysis]: Checked inductivity of 591 backedges. 275 proven. 96 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 10:40:17,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:40:17,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 52 [2018-11-07 10:40:17,380 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:40:17,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-11-07 10:40:17,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-11-07 10:40:17,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=507, Invalid=2145, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 10:40:17,381 INFO L87 Difference]: Start difference. First operand 167 states and 180 transitions. Second operand 52 states. [2018-11-07 10:40:20,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:40:20,289 INFO L93 Difference]: Finished difference Result 432 states and 496 transitions. [2018-11-07 10:40:20,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-11-07 10:40:20,289 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 129 [2018-11-07 10:40:20,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:40:20,291 INFO L225 Difference]: With dead ends: 432 [2018-11-07 10:40:20,291 INFO L226 Difference]: Without dead ends: 375 [2018-11-07 10:40:20,291 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 210 SyntacticMatches, 26 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3996 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1729, Invalid=7777, Unknown=0, NotChecked=0, Total=9506 [2018-11-07 10:40:20,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-11-07 10:40:20,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 167. [2018-11-07 10:40:20,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-11-07 10:40:20,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 180 transitions. [2018-11-07 10:40:20,602 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 180 transitions. Word has length 129 [2018-11-07 10:40:20,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:40:20,602 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 180 transitions. [2018-11-07 10:40:20,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-11-07 10:40:20,602 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 180 transitions. [2018-11-07 10:40:20,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-07 10:40:20,603 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:40:20,603 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 11, 9, 8, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:40:20,603 INFO L423 AbstractCegarLoop]: === Iteration 82 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:40:20,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:20,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1607197471, now seen corresponding path program 48 times [2018-11-07 10:40:20,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:40:20,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:20,604 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:40:20,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:20,604 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:40:20,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:20,937 INFO L134 CoverageAnalysis]: Checked inductivity of 579 backedges. 275 proven. 84 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 10:40:20,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:20,937 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:40:20,937 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:40:20,938 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:40:20,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:20,938 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:40:20,947 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:40:20,947 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:40:20,981 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:40:20,981 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:40:20,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:40:21,491 INFO L134 CoverageAnalysis]: Checked inductivity of 579 backedges. 275 proven. 84 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 10:40:21,491 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:40:21,906 INFO L134 CoverageAnalysis]: Checked inductivity of 579 backedges. 275 proven. 84 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 10:40:21,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:40:21,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 51 [2018-11-07 10:40:21,927 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:40:21,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-11-07 10:40:21,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-11-07 10:40:21,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=479, Invalid=2071, Unknown=0, NotChecked=0, Total=2550 [2018-11-07 10:40:21,928 INFO L87 Difference]: Start difference. First operand 167 states and 180 transitions. Second operand 51 states. [2018-11-07 10:40:25,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:40:25,361 INFO L93 Difference]: Finished difference Result 498 states and 575 transitions. [2018-11-07 10:40:25,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-11-07 10:40:25,362 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 129 [2018-11-07 10:40:25,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:40:25,363 INFO L225 Difference]: With dead ends: 498 [2018-11-07 10:40:25,363 INFO L226 Difference]: Without dead ends: 441 [2018-11-07 10:40:25,365 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 211 SyntacticMatches, 26 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4398 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1933, Invalid=8779, Unknown=0, NotChecked=0, Total=10712 [2018-11-07 10:40:25,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2018-11-07 10:40:25,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 167. [2018-11-07 10:40:25,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-11-07 10:40:25,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 180 transitions. [2018-11-07 10:40:25,705 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 180 transitions. Word has length 129 [2018-11-07 10:40:25,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:40:25,705 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 180 transitions. [2018-11-07 10:40:25,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-11-07 10:40:25,705 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 180 transitions. [2018-11-07 10:40:25,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-07 10:40:25,705 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:40:25,706 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 11, 8, 7, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:40:25,706 INFO L423 AbstractCegarLoop]: === Iteration 83 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:40:25,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:25,706 INFO L82 PathProgramCache]: Analyzing trace with hash -285939029, now seen corresponding path program 49 times [2018-11-07 10:40:25,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:40:25,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:25,707 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:40:25,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:25,707 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:40:25,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:26,123 INFO L134 CoverageAnalysis]: Checked inductivity of 571 backedges. 275 proven. 76 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 10:40:26,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:26,123 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:40:26,123 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:40:26,124 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:40:26,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:26,124 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:40:26,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:40:26,134 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:40:26,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:26,165 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:40:26,696 INFO L134 CoverageAnalysis]: Checked inductivity of 571 backedges. 275 proven. 76 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 10:40:26,696 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:40:26,999 INFO L134 CoverageAnalysis]: Checked inductivity of 571 backedges. 275 proven. 76 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 10:40:27,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:40:27,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 50 [2018-11-07 10:40:27,018 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:40:27,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-11-07 10:40:27,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-11-07 10:40:27,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=455, Invalid=1995, Unknown=0, NotChecked=0, Total=2450 [2018-11-07 10:40:27,019 INFO L87 Difference]: Start difference. First operand 167 states and 180 transitions. Second operand 50 states. [2018-11-07 10:40:30,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:40:30,799 INFO L93 Difference]: Finished difference Result 562 states and 652 transitions. [2018-11-07 10:40:30,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-11-07 10:40:30,799 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 129 [2018-11-07 10:40:30,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:40:30,801 INFO L225 Difference]: With dead ends: 562 [2018-11-07 10:40:30,801 INFO L226 Difference]: Without dead ends: 505 [2018-11-07 10:40:30,802 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 212 SyntacticMatches, 26 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4678 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2079, Invalid=9477, Unknown=0, NotChecked=0, Total=11556 [2018-11-07 10:40:30,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2018-11-07 10:40:31,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 167. [2018-11-07 10:40:31,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-11-07 10:40:31,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 180 transitions. [2018-11-07 10:40:31,124 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 180 transitions. Word has length 129 [2018-11-07 10:40:31,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:40:31,124 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 180 transitions. [2018-11-07 10:40:31,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-11-07 10:40:31,124 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 180 transitions. [2018-11-07 10:40:31,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-07 10:40:31,125 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:40:31,125 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 11, 7, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:40:31,125 INFO L423 AbstractCegarLoop]: === Iteration 84 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:40:31,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:31,125 INFO L82 PathProgramCache]: Analyzing trace with hash 798123319, now seen corresponding path program 50 times [2018-11-07 10:40:31,125 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:40:31,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:31,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:40:31,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:31,126 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:40:31,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:31,434 INFO L134 CoverageAnalysis]: Checked inductivity of 567 backedges. 275 proven. 72 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 10:40:31,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:31,434 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:40:31,434 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:40:31,435 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:40:31,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:31,435 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:40:31,443 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:40:31,443 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:40:31,492 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-07 10:40:31,492 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:40:31,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:40:31,994 INFO L134 CoverageAnalysis]: Checked inductivity of 567 backedges. 275 proven. 72 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 10:40:31,994 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:40:32,251 INFO L134 CoverageAnalysis]: Checked inductivity of 567 backedges. 275 proven. 72 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 10:40:32,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:40:32,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 49 [2018-11-07 10:40:32,270 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:40:32,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-11-07 10:40:32,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-11-07 10:40:32,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=1917, Unknown=0, NotChecked=0, Total=2352 [2018-11-07 10:40:32,271 INFO L87 Difference]: Start difference. First operand 167 states and 180 transitions. Second operand 49 states. [2018-11-07 10:40:36,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:40:36,537 INFO L93 Difference]: Finished difference Result 624 states and 727 transitions. [2018-11-07 10:40:36,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-11-07 10:40:36,537 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 129 [2018-11-07 10:40:36,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:40:36,539 INFO L225 Difference]: With dead ends: 624 [2018-11-07 10:40:36,539 INFO L226 Difference]: Without dead ends: 567 [2018-11-07 10:40:36,540 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 213 SyntacticMatches, 26 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4810 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2155, Invalid=9835, Unknown=0, NotChecked=0, Total=11990 [2018-11-07 10:40:36,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2018-11-07 10:40:37,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 167. [2018-11-07 10:40:37,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-11-07 10:40:37,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 180 transitions. [2018-11-07 10:40:37,141 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 180 transitions. Word has length 129 [2018-11-07 10:40:37,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:40:37,141 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 180 transitions. [2018-11-07 10:40:37,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-11-07 10:40:37,141 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 180 transitions. [2018-11-07 10:40:37,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-07 10:40:37,142 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:40:37,142 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 11, 7, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:40:37,142 INFO L423 AbstractCegarLoop]: === Iteration 85 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:40:37,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:37,143 INFO L82 PathProgramCache]: Analyzing trace with hash -903540029, now seen corresponding path program 51 times [2018-11-07 10:40:37,143 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:40:37,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:37,144 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:40:37,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:37,144 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:40:37,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:37,990 INFO L134 CoverageAnalysis]: Checked inductivity of 567 backedges. 275 proven. 72 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 10:40:37,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:37,990 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:40:37,990 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:40:37,990 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:40:37,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:37,990 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:40:37,999 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:40:37,999 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:40:38,034 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:40:38,035 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:40:38,037 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:40:38,635 INFO L134 CoverageAnalysis]: Checked inductivity of 567 backedges. 275 proven. 72 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 10:40:38,636 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:40:38,920 INFO L134 CoverageAnalysis]: Checked inductivity of 567 backedges. 275 proven. 72 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 10:40:38,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:40:38,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 48 [2018-11-07 10:40:38,942 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:40:38,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-07 10:40:38,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-07 10:40:38,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=419, Invalid=1837, Unknown=0, NotChecked=0, Total=2256 [2018-11-07 10:40:38,943 INFO L87 Difference]: Start difference. First operand 167 states and 180 transitions. Second operand 48 states. [2018-11-07 10:40:43,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:40:43,278 INFO L93 Difference]: Finished difference Result 684 states and 800 transitions. [2018-11-07 10:40:43,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-11-07 10:40:43,278 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 129 [2018-11-07 10:40:43,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:40:43,281 INFO L225 Difference]: With dead ends: 684 [2018-11-07 10:40:43,281 INFO L226 Difference]: Without dead ends: 627 [2018-11-07 10:40:43,282 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 214 SyntacticMatches, 26 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4780 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2155, Invalid=9835, Unknown=0, NotChecked=0, Total=11990 [2018-11-07 10:40:43,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2018-11-07 10:40:43,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 167. [2018-11-07 10:40:43,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-11-07 10:40:43,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 180 transitions. [2018-11-07 10:40:43,668 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 180 transitions. Word has length 129 [2018-11-07 10:40:43,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:40:43,669 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 180 transitions. [2018-11-07 10:40:43,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-07 10:40:43,669 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 180 transitions. [2018-11-07 10:40:43,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-07 10:40:43,670 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:40:43,670 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 11, 8, 7, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:40:43,670 INFO L423 AbstractCegarLoop]: === Iteration 86 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:40:43,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:43,670 INFO L82 PathProgramCache]: Analyzing trace with hash 274576207, now seen corresponding path program 52 times [2018-11-07 10:40:43,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:40:43,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:43,671 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:40:43,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:43,671 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:40:43,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:43,964 INFO L134 CoverageAnalysis]: Checked inductivity of 571 backedges. 275 proven. 76 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 10:40:43,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:43,964 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:40:43,964 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:40:43,964 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:40:43,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:43,964 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:40:43,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:40:43,973 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:40:44,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:44,009 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:40:44,482 INFO L134 CoverageAnalysis]: Checked inductivity of 571 backedges. 275 proven. 76 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 10:40:44,482 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:40:44,771 INFO L134 CoverageAnalysis]: Checked inductivity of 571 backedges. 275 proven. 76 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 10:40:44,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:40:44,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 47 [2018-11-07 10:40:44,791 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:40:44,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-11-07 10:40:44,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-11-07 10:40:44,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=407, Invalid=1755, Unknown=0, NotChecked=0, Total=2162 [2018-11-07 10:40:44,792 INFO L87 Difference]: Start difference. First operand 167 states and 180 transitions. Second operand 47 states. [2018-11-07 10:40:49,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:40:49,382 INFO L93 Difference]: Finished difference Result 742 states and 871 transitions. [2018-11-07 10:40:49,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-11-07 10:40:49,382 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 129 [2018-11-07 10:40:49,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:40:49,385 INFO L225 Difference]: With dead ends: 742 [2018-11-07 10:40:49,385 INFO L226 Difference]: Without dead ends: 685 [2018-11-07 10:40:49,386 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 215 SyntacticMatches, 26 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4582 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2079, Invalid=9477, Unknown=0, NotChecked=0, Total=11556 [2018-11-07 10:40:49,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2018-11-07 10:40:49,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 167. [2018-11-07 10:40:49,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-11-07 10:40:49,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 180 transitions. [2018-11-07 10:40:49,743 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 180 transitions. Word has length 129 [2018-11-07 10:40:49,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:40:49,743 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 180 transitions. [2018-11-07 10:40:49,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-11-07 10:40:49,743 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 180 transitions. [2018-11-07 10:40:49,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-07 10:40:49,744 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:40:49,744 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 11, 9, 8, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:40:49,744 INFO L423 AbstractCegarLoop]: === Iteration 87 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:40:49,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:49,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1994586405, now seen corresponding path program 53 times [2018-11-07 10:40:49,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:40:49,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:49,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:40:49,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:49,745 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:40:49,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:50,098 INFO L134 CoverageAnalysis]: Checked inductivity of 579 backedges. 275 proven. 84 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 10:40:50,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:50,099 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:40:50,099 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:40:50,099 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:40:50,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:50,099 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:40:50,107 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:40:50,107 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:40:50,150 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-07 10:40:50,150 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:40:50,152 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:40:50,579 INFO L134 CoverageAnalysis]: Checked inductivity of 579 backedges. 275 proven. 84 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 10:40:50,579 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:40:50,840 INFO L134 CoverageAnalysis]: Checked inductivity of 579 backedges. 275 proven. 84 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 10:40:50,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:40:50,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 46 [2018-11-07 10:40:50,859 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:40:50,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-11-07 10:40:50,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-07 10:40:50,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=1671, Unknown=0, NotChecked=0, Total=2070 [2018-11-07 10:40:50,861 INFO L87 Difference]: Start difference. First operand 167 states and 180 transitions. Second operand 46 states. [2018-11-07 10:40:55,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:40:55,650 INFO L93 Difference]: Finished difference Result 798 states and 940 transitions. [2018-11-07 10:40:55,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-11-07 10:40:55,651 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 129 [2018-11-07 10:40:55,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:40:55,653 INFO L225 Difference]: With dead ends: 798 [2018-11-07 10:40:55,653 INFO L226 Difference]: Without dead ends: 741 [2018-11-07 10:40:55,654 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 216 SyntacticMatches, 26 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4218 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1933, Invalid=8779, Unknown=0, NotChecked=0, Total=10712 [2018-11-07 10:40:55,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2018-11-07 10:40:56,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 167. [2018-11-07 10:40:56,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-11-07 10:40:56,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 180 transitions. [2018-11-07 10:40:56,024 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 180 transitions. Word has length 129 [2018-11-07 10:40:56,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:40:56,025 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 180 transitions. [2018-11-07 10:40:56,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-11-07 10:40:56,025 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 180 transitions. [2018-11-07 10:40:56,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-07 10:40:56,025 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:40:56,025 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 11, 10, 9, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:40:56,026 INFO L423 AbstractCegarLoop]: === Iteration 88 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:40:56,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:56,026 INFO L82 PathProgramCache]: Analyzing trace with hash 2087964007, now seen corresponding path program 54 times [2018-11-07 10:40:56,026 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:40:56,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:56,027 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:40:56,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:56,027 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:40:56,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:56,360 INFO L134 CoverageAnalysis]: Checked inductivity of 591 backedges. 275 proven. 96 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 10:40:56,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:56,361 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:40:56,361 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:40:56,361 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:40:56,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:56,361 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:40:56,369 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:40:56,370 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:40:56,406 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:40:56,406 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:40:56,410 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:40:56,845 INFO L134 CoverageAnalysis]: Checked inductivity of 591 backedges. 275 proven. 96 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 10:40:56,845 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:40:57,103 INFO L134 CoverageAnalysis]: Checked inductivity of 591 backedges. 275 proven. 96 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 10:40:57,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:40:57,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 45 [2018-11-07 10:40:57,123 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:40:57,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-11-07 10:40:57,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-07 10:40:57,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=395, Invalid=1585, Unknown=0, NotChecked=0, Total=1980 [2018-11-07 10:40:57,124 INFO L87 Difference]: Start difference. First operand 167 states and 180 transitions. Second operand 45 states. Received shutdown request... [2018-11-07 10:40:57,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-07 10:40:57,818 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 10:40:57,823 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 10:40:57,823 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:40:57 BoogieIcfgContainer [2018-11-07 10:40:57,824 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 10:40:57,824 INFO L168 Benchmark]: Toolchain (without parser) took 232193.12 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 749.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -801.5 MB). Peak memory consumption was 604.3 MB. Max. memory is 7.1 GB. [2018-11-07 10:40:57,825 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 10:40:57,826 INFO L168 Benchmark]: CACSL2BoogieTranslator took 316.40 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-07 10:40:57,826 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.63 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 10:40:57,826 INFO L168 Benchmark]: Boogie Preprocessor took 23.38 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 10:40:57,826 INFO L168 Benchmark]: RCFGBuilder took 477.67 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 742.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -784.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2018-11-07 10:40:57,827 INFO L168 Benchmark]: TraceAbstraction took 231349.70 ms. Allocated memory was 2.3 GB in the beginning and 2.3 GB in the end (delta: 6.8 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: -27.8 MB). Peak memory consumption was 635.6 MB. Max. memory is 7.1 GB. [2018-11-07 10:40:57,830 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 316.40 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 21.63 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.38 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 477.67 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 742.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -784.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 231349.70 ms. Allocated memory was 2.3 GB in the beginning and 2.3 GB in the end (delta: 6.8 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: -27.8 MB). Peak memory consumption was 635.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was constructing difference of abstraction (167states) and FLOYD_HOARE automaton (currently 25 states, 45 states before enhancement),while ReachableStatesComputation was computing reachable states (47 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 27 locations, 1 error locations. TIMEOUT Result, 231.2s OverallTime, 88 OverallIterations, 12 TraceHistogramMax, 125.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4159 SDtfs, 10991 SDslu, 34898 SDs, 0 SdLazy, 31800 SolverSat, 7356 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 30.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 19484 GetRequests, 12916 SyntacticMatches, 1540 SemanticMatches, 5028 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147336 ImplicationChecksByTransitivity, 118.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=167occurred in iteration=79, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.7s AbstIntTime, 3 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 11.3s AutomataMinimizationTime, 87 MinimizatonAttempts, 16034 StatesRemovedByMinimization, 76 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 2.9s SatisfiabilityAnalysisTime, 86.2s InterpolantComputationTime, 15427 NumberOfCodeBlocks, 15427 NumberOfCodeBlocksAsserted, 404 NumberOfCheckSat, 22854 ConstructedInterpolants, 0 QuantifiedInterpolants, 9084200 SizeOfPredicates, 545 NumberOfNonLiveVariables, 16590 ConjunctsInSsa, 1740 ConjunctsInUnsatCore, 258 InterpolantComputations, 3 PerfectInterpolantSequences, 60967/74867 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown