java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf -i ../../../trunk/examples/svcomp/loop-invgen/half_2_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 22:10:54,967 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 22:10:54,969 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 22:10:54,986 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 22:10:54,986 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 22:10:54,988 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 22:10:54,989 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 22:10:54,992 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 22:10:54,994 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 22:10:54,994 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 22:10:54,995 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 22:10:54,995 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 22:10:54,996 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 22:10:54,997 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 22:10:54,998 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 22:10:54,999 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 22:10:55,000 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 22:10:55,002 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 22:10:55,004 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 22:10:55,005 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 22:10:55,006 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 22:10:55,007 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 22:10:55,009 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 22:10:55,010 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 22:10:55,010 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 22:10:55,011 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 22:10:55,012 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 22:10:55,012 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 22:10:55,013 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 22:10:55,014 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 22:10:55,014 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 22:10:55,015 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 22:10:55,015 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 22:10:55,015 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 22:10:55,016 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 22:10:55,017 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 22:10:55,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-INT-LIM.epf [2018-11-07 22:10:55,042 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 22:10:55,042 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 22:10:55,043 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 22:10:55,043 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 22:10:55,043 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 22:10:55,044 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 22:10:55,044 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-07 22:10:55,044 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 22:10:55,044 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 22:10:55,044 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 22:10:55,045 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 22:10:55,045 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 22:10:55,045 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 22:10:55,046 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 22:10:55,046 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 22:10:55,047 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 22:10:55,047 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 22:10:55,047 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 22:10:55,047 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 22:10:55,047 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 22:10:55,047 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 22:10:55,048 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 22:10:55,048 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 22:10:55,048 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 22:10:55,048 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 22:10:55,048 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 22:10:55,050 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 22:10:55,050 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 22:10:55,050 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 22:10:55,051 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 22:10:55,051 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 22:10:55,051 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 22:10:55,051 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 22:10:55,051 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 22:10:55,052 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 22:10:55,099 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 22:10:55,114 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 22:10:55,119 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 22:10:55,121 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 22:10:55,121 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 22:10:55,122 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/half_2_true-unreach-call_true-termination.i [2018-11-07 22:10:55,188 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a51dfbac3/dc7bab8805b847ec8b9b9c00f67bc279/FLAG2a9dfd07e [2018-11-07 22:10:55,610 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 22:10:55,611 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/half_2_true-unreach-call_true-termination.i [2018-11-07 22:10:55,616 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a51dfbac3/dc7bab8805b847ec8b9b9c00f67bc279/FLAG2a9dfd07e [2018-11-07 22:10:55,631 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a51dfbac3/dc7bab8805b847ec8b9b9c00f67bc279 [2018-11-07 22:10:55,642 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 22:10:55,643 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 22:10:55,645 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 22:10:55,646 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 22:10:55,649 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 22:10:55,650 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:10:55" (1/1) ... [2018-11-07 22:10:55,653 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a3d082c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:55, skipping insertion in model container [2018-11-07 22:10:55,654 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:10:55" (1/1) ... [2018-11-07 22:10:55,664 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 22:10:55,686 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 22:10:55,887 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 22:10:55,890 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 22:10:55,908 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 22:10:55,925 INFO L193 MainTranslator]: Completed translation [2018-11-07 22:10:55,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:55 WrapperNode [2018-11-07 22:10:55,926 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 22:10:55,927 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 22:10:55,927 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 22:10:55,928 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 22:10:55,938 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:10:55" (1/1) ... [2018-11-07 22:10:55,946 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:10:55" (1/1) ... [2018-11-07 22:10:55,953 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 22:10:55,953 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 22:10:55,953 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 22:10:55,953 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 22:10:55,963 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:55" (1/1) ... [2018-11-07 22:10:55,964 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:55" (1/1) ... [2018-11-07 22:10:55,965 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:55" (1/1) ... [2018-11-07 22:10:55,965 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:55" (1/1) ... [2018-11-07 22:10:55,968 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:55" (1/1) ... [2018-11-07 22:10:55,974 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:55" (1/1) ... [2018-11-07 22:10:55,975 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:55" (1/1) ... [2018-11-07 22:10:55,976 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 22:10:55,977 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 22:10:55,977 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 22:10:55,977 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 22:10:55,978 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:55" (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 22:10:56,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 22:10:56,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 22:10:56,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 22:10:56,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 22:10:56,111 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 22:10:56,111 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 22:10:56,111 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 22:10:56,111 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 22:10:56,379 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 22:10:56,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:10:56 BoogieIcfgContainer [2018-11-07 22:10:56,380 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 22:10:56,380 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 22:10:56,381 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 22:10:56,384 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 22:10:56,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:10:55" (1/3) ... [2018-11-07 22:10:56,385 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e1474f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:10:56, skipping insertion in model container [2018-11-07 22:10:56,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:55" (2/3) ... [2018-11-07 22:10:56,385 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e1474f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:10:56, skipping insertion in model container [2018-11-07 22:10:56,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:10:56" (3/3) ... [2018-11-07 22:10:56,387 INFO L112 eAbstractionObserver]: Analyzing ICFG half_2_true-unreach-call_true-termination.i [2018-11-07 22:10:56,396 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 22:10:56,404 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 22:10:56,418 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 22:10:56,449 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 22:10:56,449 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 22:10:56,450 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 22:10:56,450 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 22:10:56,450 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 22:10:56,450 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 22:10:56,450 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 22:10:56,451 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 22:10:56,472 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2018-11-07 22:10:56,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-07 22:10:56,478 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:10:56,479 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:10:56,482 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:10:56,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:10:56,488 INFO L82 PathProgramCache]: Analyzing trace with hash 123572206, now seen corresponding path program 1 times [2018-11-07 22:10:56,490 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:10:56,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:10:56,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:10:56,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:10:56,538 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:10:56,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:10:56,597 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 22:10:56,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:10:56,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 22:10:56,600 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:10:56,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 22:10:56,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 22:10:56,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 22:10:56,618 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 2 states. [2018-11-07 22:10:56,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:10:56,639 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2018-11-07 22:10:56,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 22:10:56,641 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-07 22:10:56,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:10:56,649 INFO L225 Difference]: With dead ends: 40 [2018-11-07 22:10:56,649 INFO L226 Difference]: Without dead ends: 19 [2018-11-07 22:10:56,653 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 22:10:56,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-07 22:10:56,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-07 22:10:56,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-07 22:10:56,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-11-07 22:10:56,688 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 14 [2018-11-07 22:10:56,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:10:56,689 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-11-07 22:10:56,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 22:10:56,690 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-07 22:10:56,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-07 22:10:56,691 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:10:56,691 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:10:56,692 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:10:56,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:10:56,692 INFO L82 PathProgramCache]: Analyzing trace with hash -204041864, now seen corresponding path program 1 times [2018-11-07 22:10:56,692 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:10:56,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:10:56,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:10:56,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:10:56,694 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:10:56,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:10:57,016 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 22:10:57,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:10:57,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 22:10:57,017 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:10:57,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 22:10:57,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 22:10:57,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 22:10:57,020 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 5 states. [2018-11-07 22:10:57,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:10:57,316 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-11-07 22:10:57,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 22:10:57,316 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-07 22:10:57,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:10:57,317 INFO L225 Difference]: With dead ends: 34 [2018-11-07 22:10:57,318 INFO L226 Difference]: Without dead ends: 21 [2018-11-07 22:10:57,319 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-07 22:10:57,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-07 22:10:57,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-07 22:10:57,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-07 22:10:57,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-11-07 22:10:57,324 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 15 [2018-11-07 22:10:57,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:10:57,325 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-07 22:10:57,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 22:10:57,325 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-07 22:10:57,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-07 22:10:57,326 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:10:57,326 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:10:57,326 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:10:57,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:10:57,327 INFO L82 PathProgramCache]: Analyzing trace with hash 615296882, now seen corresponding path program 1 times [2018-11-07 22:10:57,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:10:57,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:10:57,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:10:57,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:10:57,328 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:10:57,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:10:57,705 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:10:57,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:10:57,706 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:10:57,707 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 18 with the following transitions: [2018-11-07 22:10:57,709 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [16], [18], [22], [26], [32], [40], [43], [45], [51], [52], [53], [55] [2018-11-07 22:10:57,742 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 22:10:57,742 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 22:10:57,869 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 22:10:58,023 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 22:10:58,025 INFO L272 AbstractInterpreter]: Visited 16 different actions 80 times. Merged at 6 different actions 39 times. Widened at 2 different actions 5 times. Found 2 fixpoints after 2 different actions. Largest state had 6 variables. [2018-11-07 22:10:58,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:10:58,042 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 22:10:58,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:10:58,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 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 22:10:58,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:10:58,062 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:10:58,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:10:58,093 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:10:58,250 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:10:58,251 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:10:58,656 WARN L179 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 17 [2018-11-07 22:10:58,781 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:10:58,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:10:58,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2018-11-07 22:10:58,804 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:10:58,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 22:10:58,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 22:10:58,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-11-07 22:10:58,805 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 9 states. [2018-11-07 22:10:59,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:10:59,334 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2018-11-07 22:10:59,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-07 22:10:59,335 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-11-07 22:10:59,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:10:59,336 INFO L225 Difference]: With dead ends: 38 [2018-11-07 22:10:59,336 INFO L226 Difference]: Without dead ends: 23 [2018-11-07 22:10:59,338 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2018-11-07 22:10:59,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-07 22:10:59,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-07 22:10:59,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-07 22:10:59,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-11-07 22:10:59,343 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 17 [2018-11-07 22:10:59,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:10:59,344 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-11-07 22:10:59,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 22:10:59,344 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-11-07 22:10:59,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-07 22:10:59,345 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:10:59,345 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:10:59,345 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:10:59,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:10:59,346 INFO L82 PathProgramCache]: Analyzing trace with hash 2020816620, now seen corresponding path program 2 times [2018-11-07 22:10:59,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:10:59,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:10:59,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:10:59,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:10:59,347 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:10:59,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:10:59,478 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:10:59,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:10:59,478 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:10:59,479 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:10:59,479 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:10:59,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:10:59,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 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 22:10:59,499 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:10:59,500 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:10:59,544 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 22:10:59,544 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:10:59,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:10:59,654 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:10:59,654 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:10:59,731 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:10:59,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:10:59,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-11-07 22:10:59,752 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:10:59,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 22:10:59,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 22:10:59,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-11-07 22:10:59,753 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 9 states. [2018-11-07 22:10:59,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:10:59,881 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2018-11-07 22:10:59,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 22:10:59,882 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-11-07 22:10:59,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:10:59,885 INFO L225 Difference]: With dead ends: 37 [2018-11-07 22:10:59,885 INFO L226 Difference]: Without dead ends: 35 [2018-11-07 22:10:59,886 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2018-11-07 22:10:59,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-07 22:10:59,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2018-11-07 22:10:59,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-07 22:10:59,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-11-07 22:10:59,895 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 19 [2018-11-07 22:10:59,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:10:59,896 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-11-07 22:10:59,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 22:10:59,896 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-11-07 22:10:59,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-07 22:10:59,897 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:10:59,897 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] [2018-11-07 22:10:59,898 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:10:59,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:10:59,898 INFO L82 PathProgramCache]: Analyzing trace with hash 214509359, now seen corresponding path program 1 times [2018-11-07 22:10:59,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:10:59,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:10:59,899 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:10:59,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:10:59,900 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:10:59,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:11:00,326 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:11:00,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:00,327 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:11:00,327 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-11-07 22:11:00,327 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [16], [18], [22], [26], [32], [34], [40], [43], [45], [48], [50], [51], [52], [53], [55], [56] [2018-11-07 22:11:00,329 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 22:11:00,329 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 22:11:00,346 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 22:11:00,636 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 22:11:00,637 INFO L272 AbstractInterpreter]: Visited 20 different actions 130 times. Merged at 8 different actions 55 times. Widened at 3 different actions 7 times. Found 9 fixpoints after 4 different actions. Largest state had 8 variables. [2018-11-07 22:11:00,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:11:00,665 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 22:11:00,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:00,665 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 22:11:00,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:11:00,685 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:11:00,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:11:00,715 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:11:01,308 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:11:01,308 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:11:01,859 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:11:01,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:11:01,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 25 [2018-11-07 22:11:01,879 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:11:01,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 22:11:01,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 22:11:01,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2018-11-07 22:11:01,881 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 18 states. [2018-11-07 22:11:02,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:11:02,270 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2018-11-07 22:11:02,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-07 22:11:02,270 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 27 [2018-11-07 22:11:02,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:11:02,273 INFO L225 Difference]: With dead ends: 55 [2018-11-07 22:11:02,273 INFO L226 Difference]: Without dead ends: 32 [2018-11-07 22:11:02,275 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 38 SyntacticMatches, 6 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=146, Invalid=784, Unknown=0, NotChecked=0, Total=930 [2018-11-07 22:11:02,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-07 22:11:02,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-11-07 22:11:02,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-07 22:11:02,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2018-11-07 22:11:02,281 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 27 [2018-11-07 22:11:02,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:11:02,281 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2018-11-07 22:11:02,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 22:11:02,281 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2018-11-07 22:11:02,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-07 22:11:02,282 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:11:02,283 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:11:02,283 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:11:02,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:11:02,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1884298793, now seen corresponding path program 2 times [2018-11-07 22:11:02,283 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:11:02,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:02,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:11:02,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:02,285 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:11:02,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:11:02,413 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:11:02,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:02,413 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:11:02,413 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:11:02,414 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:11:02,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:02,414 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 22:11:02,423 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:11:02,423 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:11:02,437 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-07 22:11:02,437 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:11:02,441 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:11:02,550 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:11:02,550 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:11:02,760 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:11:02,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:11:02,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 20 [2018-11-07 22:11:02,781 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:11:02,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-07 22:11:02,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-07 22:11:02,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2018-11-07 22:11:02,782 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 15 states. [2018-11-07 22:11:03,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:11:03,310 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2018-11-07 22:11:03,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-07 22:11:03,310 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2018-11-07 22:11:03,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:11:03,311 INFO L225 Difference]: With dead ends: 47 [2018-11-07 22:11:03,311 INFO L226 Difference]: Without dead ends: 45 [2018-11-07 22:11:03,312 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 46 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=532, Unknown=0, NotChecked=0, Total=650 [2018-11-07 22:11:03,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-07 22:11:03,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 40. [2018-11-07 22:11:03,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-07 22:11:03,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2018-11-07 22:11:03,320 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 29 [2018-11-07 22:11:03,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:11:03,320 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2018-11-07 22:11:03,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-07 22:11:03,321 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-11-07 22:11:03,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-07 22:11:03,322 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:11:03,322 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] [2018-11-07 22:11:03,322 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:11:03,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:11:03,323 INFO L82 PathProgramCache]: Analyzing trace with hash 2099085676, now seen corresponding path program 3 times [2018-11-07 22:11:03,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:11:03,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:03,324 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:11:03,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:03,324 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:11:03,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:11:03,800 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 7 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-07 22:11:03,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:03,800 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:11:03,800 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:11:03,800 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:11:03,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:03,801 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 22:11:03,809 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:11:03,810 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:11:03,823 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:11:03,823 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:11:03,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:11:04,398 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-07 22:11:04,399 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:11:04,903 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-07 22:11:04,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:11:04,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 31 [2018-11-07 22:11:04,923 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:11:04,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-07 22:11:04,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-07 22:11:04,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=798, Unknown=0, NotChecked=0, Total=930 [2018-11-07 22:11:04,925 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 22 states. [2018-11-07 22:11:05,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:11:05,739 INFO L93 Difference]: Finished difference Result 79 states and 84 transitions. [2018-11-07 22:11:05,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 22:11:05,740 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 37 [2018-11-07 22:11:05,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:11:05,742 INFO L225 Difference]: With dead ends: 79 [2018-11-07 22:11:05,742 INFO L226 Difference]: Without dead ends: 52 [2018-11-07 22:11:05,743 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 54 SyntacticMatches, 6 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=205, Invalid=1201, Unknown=0, NotChecked=0, Total=1406 [2018-11-07 22:11:05,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-07 22:11:05,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 42. [2018-11-07 22:11:05,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-07 22:11:05,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2018-11-07 22:11:05,751 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 37 [2018-11-07 22:11:05,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:11:05,751 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-11-07 22:11:05,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-07 22:11:05,751 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-11-07 22:11:05,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-07 22:11:05,752 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:11:05,753 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:11:05,753 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:11:05,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:11:05,753 INFO L82 PathProgramCache]: Analyzing trace with hash -599816218, now seen corresponding path program 4 times [2018-11-07 22:11:05,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:11:05,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:05,754 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:11:05,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:05,755 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:11:05,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:11:06,045 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 15 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-07 22:11:06,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:06,046 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:11:06,046 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:11:06,046 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:11:06,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:06,046 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 22:11:06,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:11:06,057 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:11:06,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:11:06,074 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:11:06,239 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 22:11:06,239 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:11:06,349 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 22:11:06,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:11:06,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 22 [2018-11-07 22:11:06,369 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:11:06,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 22:11:06,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 22:11:06,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2018-11-07 22:11:06,370 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 18 states. [2018-11-07 22:11:06,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:11:06,667 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2018-11-07 22:11:06,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-07 22:11:06,667 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 39 [2018-11-07 22:11:06,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:11:06,669 INFO L225 Difference]: With dead ends: 57 [2018-11-07 22:11:06,669 INFO L226 Difference]: Without dead ends: 55 [2018-11-07 22:11:06,670 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 67 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=164, Invalid=706, Unknown=0, NotChecked=0, Total=870 [2018-11-07 22:11:06,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-07 22:11:06,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2018-11-07 22:11:06,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-07 22:11:06,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2018-11-07 22:11:06,677 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 39 [2018-11-07 22:11:06,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:11:06,678 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2018-11-07 22:11:06,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 22:11:06,678 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2018-11-07 22:11:06,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-07 22:11:06,679 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:11:06,679 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] [2018-11-07 22:11:06,680 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:11:06,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:11:06,680 INFO L82 PathProgramCache]: Analyzing trace with hash 303685161, now seen corresponding path program 5 times [2018-11-07 22:11:06,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:11:06,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:06,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:11:06,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:06,681 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:11:06,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:11:07,251 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 17 proven. 36 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-07 22:11:07,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:07,251 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:11:07,252 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:11:07,252 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:11:07,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:07,252 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 22:11:07,264 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:11:07,264 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:11:07,302 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-07 22:11:07,302 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:11:07,305 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:11:07,652 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 11 proven. 42 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-07 22:11:07,652 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:11:08,204 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 11 proven. 42 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-07 22:11:08,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:11:08,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 16] total 39 [2018-11-07 22:11:08,225 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:11:08,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-07 22:11:08,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-07 22:11:08,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1311, Unknown=0, NotChecked=0, Total=1482 [2018-11-07 22:11:08,234 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 28 states. [2018-11-07 22:11:09,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:11:09,372 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2018-11-07 22:11:09,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-07 22:11:09,372 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 47 [2018-11-07 22:11:09,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:11:09,374 INFO L225 Difference]: With dead ends: 79 [2018-11-07 22:11:09,374 INFO L226 Difference]: Without dead ends: 52 [2018-11-07 22:11:09,376 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 69 SyntacticMatches, 5 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=324, Invalid=2538, Unknown=0, NotChecked=0, Total=2862 [2018-11-07 22:11:09,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-07 22:11:09,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-11-07 22:11:09,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-07 22:11:09,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2018-11-07 22:11:09,383 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 47 [2018-11-07 22:11:09,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:11:09,383 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2018-11-07 22:11:09,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-07 22:11:09,383 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2018-11-07 22:11:09,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-07 22:11:09,385 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:11:09,385 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:11:09,385 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:11:09,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:11:09,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1075211229, now seen corresponding path program 6 times [2018-11-07 22:11:09,386 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:11:09,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:09,387 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:11:09,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:09,387 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:11:09,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:11:09,565 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 25 proven. 38 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-07 22:11:09,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:09,565 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:11:09,565 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:11:09,566 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:11:09,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:09,566 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 22:11:09,577 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:11:09,577 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:11:09,592 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:11:09,593 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:11:09,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:11:09,795 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 5 proven. 58 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-07 22:11:09,795 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:11:09,967 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 5 proven. 58 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-07 22:11:09,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:11:09,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15] total 28 [2018-11-07 22:11:09,989 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:11:09,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-07 22:11:09,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-07 22:11:09,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=636, Unknown=0, NotChecked=0, Total=756 [2018-11-07 22:11:09,990 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 21 states. [2018-11-07 22:11:10,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:11:10,330 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2018-11-07 22:11:10,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-07 22:11:10,330 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 49 [2018-11-07 22:11:10,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:11:10,332 INFO L225 Difference]: With dead ends: 67 [2018-11-07 22:11:10,332 INFO L226 Difference]: Without dead ends: 65 [2018-11-07 22:11:10,334 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 80 SyntacticMatches, 7 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=245, Invalid=1161, Unknown=0, NotChecked=0, Total=1406 [2018-11-07 22:11:10,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-07 22:11:10,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2018-11-07 22:11:10,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-07 22:11:10,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2018-11-07 22:11:10,341 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 49 [2018-11-07 22:11:10,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:11:10,341 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2018-11-07 22:11:10,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-07 22:11:10,342 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2018-11-07 22:11:10,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-07 22:11:10,343 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:11:10,343 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] [2018-11-07 22:11:10,343 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:11:10,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:11:10,343 INFO L82 PathProgramCache]: Analyzing trace with hash 893803878, now seen corresponding path program 7 times [2018-11-07 22:11:10,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:11:10,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:10,344 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:11:10,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:10,345 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:11:10,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:11:10,823 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 31 proven. 52 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-07 22:11:10,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:10,824 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:11:10,824 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:11:10,824 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:11:10,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:10,824 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 22:11:10,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:11:10,833 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:11:10,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:11:10,865 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:11:11,307 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 7 proven. 76 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-07 22:11:11,308 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:11:12,096 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 7 proven. 76 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-07 22:11:12,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:11:12,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 43 [2018-11-07 22:11:12,116 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:11:12,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-07 22:11:12,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-07 22:11:12,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=1564, Unknown=0, NotChecked=0, Total=1806 [2018-11-07 22:11:12,118 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 30 states. [2018-11-07 22:11:13,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:11:13,092 INFO L93 Difference]: Finished difference Result 115 states and 120 transitions. [2018-11-07 22:11:13,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-07 22:11:13,092 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 57 [2018-11-07 22:11:13,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:11:13,094 INFO L225 Difference]: With dead ends: 115 [2018-11-07 22:11:13,094 INFO L226 Difference]: Without dead ends: 72 [2018-11-07 22:11:13,096 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 86 SyntacticMatches, 6 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 701 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=362, Invalid=2290, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 22:11:13,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-07 22:11:13,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 62. [2018-11-07 22:11:13,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-07 22:11:13,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2018-11-07 22:11:13,104 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 57 [2018-11-07 22:11:13,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:11:13,104 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2018-11-07 22:11:13,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-07 22:11:13,104 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2018-11-07 22:11:13,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-07 22:11:13,105 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:11:13,105 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:11:13,105 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:11:13,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:11:13,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1175347936, now seen corresponding path program 8 times [2018-11-07 22:11:13,106 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:11:13,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:13,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:11:13,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:13,107 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:11:13,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:11:13,328 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 37 proven. 58 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-07 22:11:13,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:13,329 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:11:13,329 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:11:13,329 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:11:13,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:13,329 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 22:11:13,339 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:11:13,339 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:11:13,363 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-07 22:11:13,363 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:11:13,366 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:11:13,523 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 16 proven. 79 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-07 22:11:13,523 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:11:13,872 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 16 proven. 79 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-07 22:11:13,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:11:13,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 32 [2018-11-07 22:11:13,894 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:11:13,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-07 22:11:13,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-07 22:11:13,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=834, Unknown=0, NotChecked=0, Total=992 [2018-11-07 22:11:13,895 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand 24 states. [2018-11-07 22:11:14,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:11:14,427 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2018-11-07 22:11:14,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-07 22:11:14,428 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 59 [2018-11-07 22:11:14,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:11:14,429 INFO L225 Difference]: With dead ends: 77 [2018-11-07 22:11:14,429 INFO L226 Difference]: Without dead ends: 75 [2018-11-07 22:11:14,430 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 97 SyntacticMatches, 8 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=337, Invalid=1555, Unknown=0, NotChecked=0, Total=1892 [2018-11-07 22:11:14,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-07 22:11:14,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 70. [2018-11-07 22:11:14,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-07 22:11:14,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2018-11-07 22:11:14,442 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 59 [2018-11-07 22:11:14,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:11:14,443 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2018-11-07 22:11:14,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-07 22:11:14,443 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2018-11-07 22:11:14,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-07 22:11:14,444 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:11:14,444 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] [2018-11-07 22:11:14,445 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:11:14,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:11:14,445 INFO L82 PathProgramCache]: Analyzing trace with hash -549249245, now seen corresponding path program 9 times [2018-11-07 22:11:14,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:11:14,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:14,446 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:11:14,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:14,446 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:11:14,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:11:14,892 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 49 proven. 70 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-07 22:11:14,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:14,892 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:11:14,892 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:11:14,892 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:11:14,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:14,893 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 22:11:14,906 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:11:14,907 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:11:14,937 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:11:14,938 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:11:14,940 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:11:15,416 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 21 proven. 98 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-07 22:11:15,417 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:11:16,974 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 21 proven. 98 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-07 22:11:16,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:11:16,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 49 [2018-11-07 22:11:16,993 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:11:16,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-07 22:11:16,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-07 22:11:16,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=2046, Unknown=0, NotChecked=0, Total=2352 [2018-11-07 22:11:16,995 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand 34 states. [2018-11-07 22:11:18,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:11:18,194 INFO L93 Difference]: Finished difference Result 133 states and 138 transitions. [2018-11-07 22:11:18,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-07 22:11:18,195 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 67 [2018-11-07 22:11:18,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:11:18,196 INFO L225 Difference]: With dead ends: 133 [2018-11-07 22:11:18,197 INFO L226 Difference]: Without dead ends: 82 [2018-11-07 22:11:18,199 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 102 SyntacticMatches, 6 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=454, Invalid=2968, Unknown=0, NotChecked=0, Total=3422 [2018-11-07 22:11:18,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-07 22:11:18,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 72. [2018-11-07 22:11:18,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-07 22:11:18,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2018-11-07 22:11:18,207 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 67 [2018-11-07 22:11:18,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:11:18,208 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2018-11-07 22:11:18,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-07 22:11:18,208 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2018-11-07 22:11:18,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-07 22:11:18,209 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:11:18,209 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:11:18,209 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:11:18,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:11:18,210 INFO L82 PathProgramCache]: Analyzing trace with hash 42341405, now seen corresponding path program 10 times [2018-11-07 22:11:18,210 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:11:18,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:18,210 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:11:18,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:18,211 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:11:18,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:11:18,832 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 51 proven. 82 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-07 22:11:18,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:18,833 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:11:18,833 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:11:18,833 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:11:18,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:18,833 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 22:11:18,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:11:18,843 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:11:18,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:11:18,867 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:11:19,529 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 10 proven. 111 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 22:11:19,529 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:11:19,824 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 10 proven. 111 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 22:11:19,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:11:19,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 34 [2018-11-07 22:11:19,844 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:11:19,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-07 22:11:19,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-07 22:11:19,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=935, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 22:11:19,845 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 27 states. [2018-11-07 22:11:20,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:11:20,351 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2018-11-07 22:11:20,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-07 22:11:20,352 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 69 [2018-11-07 22:11:20,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:11:20,353 INFO L225 Difference]: With dead ends: 87 [2018-11-07 22:11:20,353 INFO L226 Difference]: Without dead ends: 85 [2018-11-07 22:11:20,354 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 118 SyntacticMatches, 7 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 646 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=413, Invalid=1843, Unknown=0, NotChecked=0, Total=2256 [2018-11-07 22:11:20,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-07 22:11:20,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 80. [2018-11-07 22:11:20,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-07 22:11:20,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2018-11-07 22:11:20,362 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 69 [2018-11-07 22:11:20,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:11:20,362 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2018-11-07 22:11:20,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-07 22:11:20,362 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2018-11-07 22:11:20,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-07 22:11:20,363 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:11:20,363 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] [2018-11-07 22:11:20,363 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:11:20,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:11:20,364 INFO L82 PathProgramCache]: Analyzing trace with hash -641186976, now seen corresponding path program 11 times [2018-11-07 22:11:20,364 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:11:20,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:20,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:11:20,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:20,365 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:11:20,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:11:21,800 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 71 proven. 90 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-07 22:11:21,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:21,801 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:11:21,801 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:11:21,801 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:11:21,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:21,801 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 22:11:21,814 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:11:21,814 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:11:21,934 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-07 22:11:21,935 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:11:21,938 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:11:22,721 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 26 proven. 135 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-07 22:11:22,721 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:11:23,452 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 26 proven. 135 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-07 22:11:23,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:11:23,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23, 22] total 56 [2018-11-07 22:11:23,472 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:11:23,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-07 22:11:23,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-07 22:11:23,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=380, Invalid=2700, Unknown=0, NotChecked=0, Total=3080 [2018-11-07 22:11:23,474 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand 39 states. [2018-11-07 22:11:24,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:11:24,529 INFO L93 Difference]: Finished difference Result 121 states and 130 transitions. [2018-11-07 22:11:24,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-07 22:11:24,529 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 77 [2018-11-07 22:11:24,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:11:24,531 INFO L225 Difference]: With dead ends: 121 [2018-11-07 22:11:24,531 INFO L226 Difference]: Without dead ends: 82 [2018-11-07 22:11:24,534 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 118 SyntacticMatches, 5 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1536 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=553, Invalid=4003, Unknown=0, NotChecked=0, Total=4556 [2018-11-07 22:11:24,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-07 22:11:24,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-11-07 22:11:24,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-07 22:11:24,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2018-11-07 22:11:24,541 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 77 [2018-11-07 22:11:24,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:11:24,541 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions. [2018-11-07 22:11:24,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-07 22:11:24,541 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2018-11-07 22:11:24,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-07 22:11:24,542 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:11:24,542 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:11:24,543 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:11:24,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:11:24,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1270822950, now seen corresponding path program 12 times [2018-11-07 22:11:24,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:11:24,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:24,544 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:11:24,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:24,544 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:11:24,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:11:24,824 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 67 proven. 110 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-07 22:11:24,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:24,824 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:11:24,825 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:11:24,825 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:11:24,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:24,825 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 22:11:24,833 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:11:24,833 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:11:24,858 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:11:24,858 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:11:24,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:11:25,074 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 11 proven. 166 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-07 22:11:25,074 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:11:25,751 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 11 proven. 166 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-07 22:11:25,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:11:25,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21, 21] total 40 [2018-11-07 22:11:25,770 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:11:25,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-07 22:11:25,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-07 22:11:25,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=1320, Unknown=0, NotChecked=0, Total=1560 [2018-11-07 22:11:25,772 INFO L87 Difference]: Start difference. First operand 82 states and 83 transitions. Second operand 30 states. [2018-11-07 22:11:26,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:11:26,394 INFO L93 Difference]: Finished difference Result 97 states and 99 transitions. [2018-11-07 22:11:26,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-07 22:11:26,395 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 79 [2018-11-07 22:11:26,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:11:26,397 INFO L225 Difference]: With dead ends: 97 [2018-11-07 22:11:26,397 INFO L226 Difference]: Without dead ends: 95 [2018-11-07 22:11:26,399 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 131 SyntacticMatches, 10 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 948 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=533, Invalid=2547, Unknown=0, NotChecked=0, Total=3080 [2018-11-07 22:11:26,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-07 22:11:26,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 90. [2018-11-07 22:11:26,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-07 22:11:26,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 91 transitions. [2018-11-07 22:11:26,406 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 91 transitions. Word has length 79 [2018-11-07 22:11:26,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:11:26,407 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 91 transitions. [2018-11-07 22:11:26,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-07 22:11:26,407 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2018-11-07 22:11:26,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-07 22:11:26,408 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:11:26,408 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] [2018-11-07 22:11:26,409 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:11:26,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:11:26,409 INFO L82 PathProgramCache]: Analyzing trace with hash -2119833059, now seen corresponding path program 13 times [2018-11-07 22:11:26,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:11:26,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:26,410 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:11:26,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:26,410 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:11:26,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:11:27,048 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 97 proven. 112 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-07 22:11:27,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:27,048 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:11:27,048 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:11:27,048 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:11:27,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:27,049 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 22:11:27,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:11:27,057 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:11:27,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:11:27,086 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:11:27,702 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 13 proven. 196 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-07 22:11:27,703 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:11:28,766 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 13 proven. 196 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-07 22:11:28,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:11:28,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 61 [2018-11-07 22:11:28,786 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:11:28,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-07 22:11:28,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-07 22:11:28,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=473, Invalid=3187, Unknown=0, NotChecked=0, Total=3660 [2018-11-07 22:11:28,788 INFO L87 Difference]: Start difference. First operand 90 states and 91 transitions. Second operand 42 states. [2018-11-07 22:11:30,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:11:30,125 INFO L93 Difference]: Finished difference Result 169 states and 174 transitions. [2018-11-07 22:11:30,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-07 22:11:30,125 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 87 [2018-11-07 22:11:30,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:11:30,128 INFO L225 Difference]: With dead ends: 169 [2018-11-07 22:11:30,128 INFO L226 Difference]: Without dead ends: 102 [2018-11-07 22:11:30,130 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 134 SyntacticMatches, 6 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1472 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=686, Invalid=4570, Unknown=0, NotChecked=0, Total=5256 [2018-11-07 22:11:30,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-07 22:11:30,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 92. [2018-11-07 22:11:30,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-07 22:11:30,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 93 transitions. [2018-11-07 22:11:30,137 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 93 transitions. Word has length 87 [2018-11-07 22:11:30,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:11:30,137 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 93 transitions. [2018-11-07 22:11:30,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-07 22:11:30,137 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 93 transitions. [2018-11-07 22:11:30,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-07 22:11:30,138 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:11:30,139 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 8, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:11:30,139 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:11:30,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:11:30,139 INFO L82 PathProgramCache]: Analyzing trace with hash -2025415145, now seen corresponding path program 14 times [2018-11-07 22:11:30,139 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:11:30,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:30,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:11:30,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:30,140 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:11:30,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:11:30,484 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 85 proven. 142 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-07 22:11:30,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:30,484 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:11:30,484 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:11:30,484 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:11:30,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:30,485 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 22:11:30,493 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:11:30,493 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:11:30,530 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-07 22:11:30,530 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:11:30,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:11:30,807 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 31 proven. 196 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-07 22:11:30,807 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:11:31,137 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 31 proven. 196 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-07 22:11:31,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:11:31,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23, 23] total 44 [2018-11-07 22:11:31,157 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:11:31,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-07 22:11:31,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-07 22:11:31,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=1596, Unknown=0, NotChecked=0, Total=1892 [2018-11-07 22:11:31,159 INFO L87 Difference]: Start difference. First operand 92 states and 93 transitions. Second operand 33 states. [2018-11-07 22:11:31,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:11:31,888 INFO L93 Difference]: Finished difference Result 107 states and 109 transitions. [2018-11-07 22:11:31,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-07 22:11:31,889 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 89 [2018-11-07 22:11:31,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:11:31,890 INFO L225 Difference]: With dead ends: 107 [2018-11-07 22:11:31,891 INFO L226 Difference]: Without dead ends: 105 [2018-11-07 22:11:31,892 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 148 SyntacticMatches, 11 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1184 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=673, Invalid=3109, Unknown=0, NotChecked=0, Total=3782 [2018-11-07 22:11:31,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-07 22:11:31,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 100. [2018-11-07 22:11:31,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-07 22:11:31,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2018-11-07 22:11:31,900 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 89 [2018-11-07 22:11:31,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:11:31,901 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2018-11-07 22:11:31,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-07 22:11:31,901 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2018-11-07 22:11:31,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-07 22:11:31,902 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:11:31,903 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] [2018-11-07 22:11:31,903 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:11:31,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:11:31,903 INFO L82 PathProgramCache]: Analyzing trace with hash 147075930, now seen corresponding path program 15 times [2018-11-07 22:11:31,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:11:31,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:31,904 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:11:31,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:31,904 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:11:31,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:11:32,639 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 127 proven. 136 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-11-07 22:11:32,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:32,639 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:11:32,639 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:11:32,639 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:11:32,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:32,640 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 22:11:32,649 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:11:32,649 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:11:32,679 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:11:32,679 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:11:32,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:11:33,425 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 36 proven. 227 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-11-07 22:11:33,425 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:11:34,902 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 36 proven. 227 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-11-07 22:11:34,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:11:34,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 67 [2018-11-07 22:11:34,922 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:11:34,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-11-07 22:11:34,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-07 22:11:34,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=3861, Unknown=0, NotChecked=0, Total=4422 [2018-11-07 22:11:34,924 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand 46 states. [2018-11-07 22:11:36,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:11:36,322 INFO L93 Difference]: Finished difference Result 187 states and 192 transitions. [2018-11-07 22:11:36,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-07 22:11:36,322 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 97 [2018-11-07 22:11:36,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:11:36,324 INFO L225 Difference]: With dead ends: 187 [2018-11-07 22:11:36,324 INFO L226 Difference]: Without dead ends: 112 [2018-11-07 22:11:36,325 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 150 SyntacticMatches, 6 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1779 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=811, Invalid=5509, Unknown=0, NotChecked=0, Total=6320 [2018-11-07 22:11:36,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-07 22:11:36,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 102. [2018-11-07 22:11:36,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-07 22:11:36,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 103 transitions. [2018-11-07 22:11:36,332 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 103 transitions. Word has length 97 [2018-11-07 22:11:36,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:11:36,332 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 103 transitions. [2018-11-07 22:11:36,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-11-07 22:11:36,333 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 103 transitions. [2018-11-07 22:11:36,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-07 22:11:36,333 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:11:36,334 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 9, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:11:36,334 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:11:36,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:11:36,334 INFO L82 PathProgramCache]: Analyzing trace with hash -692603180, now seen corresponding path program 16 times [2018-11-07 22:11:36,334 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:11:36,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:36,335 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:11:36,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:36,335 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:11:36,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:11:36,692 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 105 proven. 178 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-11-07 22:11:36,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:36,693 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:11:36,693 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:11:36,693 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:11:36,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:36,693 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 22:11:36,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:11:36,702 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:11:36,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:11:36,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:11:36,991 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 16 proven. 246 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-07 22:11:36,992 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:11:38,148 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 16 proven. 246 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-07 22:11:38,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:11:38,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 46 [2018-11-07 22:11:38,168 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:11:38,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-07 22:11:38,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-07 22:11:38,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=337, Invalid=1733, Unknown=0, NotChecked=0, Total=2070 [2018-11-07 22:11:38,169 INFO L87 Difference]: Start difference. First operand 102 states and 103 transitions. Second operand 36 states. [2018-11-07 22:11:38,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:11:38,984 INFO L93 Difference]: Finished difference Result 117 states and 119 transitions. [2018-11-07 22:11:38,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-07 22:11:38,984 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 99 [2018-11-07 22:11:38,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:11:38,986 INFO L225 Difference]: With dead ends: 117 [2018-11-07 22:11:38,986 INFO L226 Difference]: Without dead ends: 115 [2018-11-07 22:11:38,987 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 169 SyntacticMatches, 10 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1315 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=779, Invalid=3511, Unknown=0, NotChecked=0, Total=4290 [2018-11-07 22:11:38,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-11-07 22:11:38,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 110. [2018-11-07 22:11:38,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-07 22:11:38,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 111 transitions. [2018-11-07 22:11:38,994 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 111 transitions. Word has length 99 [2018-11-07 22:11:38,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:11:38,995 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 111 transitions. [2018-11-07 22:11:38,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-07 22:11:38,995 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 111 transitions. [2018-11-07 22:11:38,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-07 22:11:38,996 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:11:38,996 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] [2018-11-07 22:11:38,996 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:11:38,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:11:38,996 INFO L82 PathProgramCache]: Analyzing trace with hash 941834007, now seen corresponding path program 17 times [2018-11-07 22:11:38,996 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:11:38,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:38,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:11:38,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:38,997 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:11:39,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:11:40,028 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 161 proven. 162 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-11-07 22:11:40,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:40,028 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:11:40,028 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:11:40,028 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:11:40,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:40,028 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 22:11:40,037 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:11:40,037 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:11:40,079 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-07 22:11:40,079 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:11:40,081 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:11:40,801 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 41 proven. 282 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-11-07 22:11:40,802 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:11:41,991 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 41 proven. 282 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-11-07 22:11:42,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:11:42,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 29, 28] total 74 [2018-11-07 22:11:42,012 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:11:42,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-11-07 22:11:42,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-11-07 22:11:42,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=668, Invalid=4734, Unknown=0, NotChecked=0, Total=5402 [2018-11-07 22:11:42,014 INFO L87 Difference]: Start difference. First operand 110 states and 111 transitions. Second operand 51 states. [2018-11-07 22:11:43,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:11:43,722 INFO L93 Difference]: Finished difference Result 163 states and 175 transitions. [2018-11-07 22:11:43,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-07 22:11:43,730 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 107 [2018-11-07 22:11:43,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:11:43,731 INFO L225 Difference]: With dead ends: 163 [2018-11-07 22:11:43,731 INFO L226 Difference]: Without dead ends: 112 [2018-11-07 22:11:43,733 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 166 SyntacticMatches, 5 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2895 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=931, Invalid=6901, Unknown=0, NotChecked=0, Total=7832 [2018-11-07 22:11:43,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-07 22:11:43,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-11-07 22:11:43,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-07 22:11:43,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 113 transitions. [2018-11-07 22:11:43,742 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 113 transitions. Word has length 107 [2018-11-07 22:11:43,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:11:43,742 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 113 transitions. [2018-11-07 22:11:43,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-11-07 22:11:43,742 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 113 transitions. [2018-11-07 22:11:43,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-07 22:11:43,743 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:11:43,743 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:11:43,743 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:11:43,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:11:43,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1858875921, now seen corresponding path program 18 times [2018-11-07 22:11:43,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:11:43,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:43,744 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:11:43,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:43,745 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:11:43,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:11:44,950 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 127 proven. 218 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-11-07 22:11:44,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:44,951 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:11:44,951 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:11:44,951 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:11:44,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:44,951 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 22:11:44,966 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:11:44,966 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:11:45,002 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:11:45,002 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:11:45,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:11:45,351 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 17 proven. 328 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-11-07 22:11:45,351 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:11:45,932 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 17 proven. 328 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-11-07 22:11:45,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:11:45,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27, 27] total 52 [2018-11-07 22:11:45,952 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:11:45,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-07 22:11:45,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-07 22:11:45,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=405, Invalid=2247, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 22:11:45,953 INFO L87 Difference]: Start difference. First operand 112 states and 113 transitions. Second operand 39 states. [2018-11-07 22:11:46,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:11:46,815 INFO L93 Difference]: Finished difference Result 127 states and 129 transitions. [2018-11-07 22:11:46,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-07 22:11:46,816 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 109 [2018-11-07 22:11:46,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:11:46,818 INFO L225 Difference]: With dead ends: 127 [2018-11-07 22:11:46,818 INFO L226 Difference]: Without dead ends: 125 [2018-11-07 22:11:46,819 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 182 SyntacticMatches, 13 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1737 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=938, Invalid=4464, Unknown=0, NotChecked=0, Total=5402 [2018-11-07 22:11:46,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-11-07 22:11:46,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 120. [2018-11-07 22:11:46,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-07 22:11:46,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 121 transitions. [2018-11-07 22:11:46,826 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 121 transitions. Word has length 109 [2018-11-07 22:11:46,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:11:46,827 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 121 transitions. [2018-11-07 22:11:46,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-07 22:11:46,827 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 121 transitions. [2018-11-07 22:11:46,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-07 22:11:46,828 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:11:46,828 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] [2018-11-07 22:11:46,828 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:11:46,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:11:46,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1311036076, now seen corresponding path program 19 times [2018-11-07 22:11:46,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:11:46,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:46,829 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:11:46,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:46,829 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:11:46,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:11:47,720 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 199 proven. 190 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-11-07 22:11:47,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:47,720 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:11:47,720 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:11:47,721 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:11:47,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:47,721 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 22:11:47,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:11:47,730 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:11:47,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:11:47,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:11:48,706 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 19 proven. 370 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-11-07 22:11:48,707 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:11:50,686 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 19 proven. 370 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-11-07 22:11:50,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:11:50,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 79 [2018-11-07 22:11:50,706 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:11:50,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-11-07 22:11:50,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-11-07 22:11:50,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=785, Invalid=5377, Unknown=0, NotChecked=0, Total=6162 [2018-11-07 22:11:50,708 INFO L87 Difference]: Start difference. First operand 120 states and 121 transitions. Second operand 54 states. [2018-11-07 22:11:53,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:11:53,347 INFO L93 Difference]: Finished difference Result 223 states and 228 transitions. [2018-11-07 22:11:53,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-07 22:11:53,347 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 117 [2018-11-07 22:11:53,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:11:53,349 INFO L225 Difference]: With dead ends: 223 [2018-11-07 22:11:53,350 INFO L226 Difference]: Without dead ends: 132 [2018-11-07 22:11:53,351 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 182 SyntacticMatches, 6 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2513 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1118, Invalid=7624, Unknown=0, NotChecked=0, Total=8742 [2018-11-07 22:11:53,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-11-07 22:11:53,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 122. [2018-11-07 22:11:53,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-07 22:11:53,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 123 transitions. [2018-11-07 22:11:53,360 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 123 transitions. Word has length 117 [2018-11-07 22:11:53,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:11:53,360 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 123 transitions. [2018-11-07 22:11:53,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-11-07 22:11:53,360 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 123 transitions. [2018-11-07 22:11:53,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-07 22:11:53,361 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:11:53,361 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:11:53,361 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:11:53,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:11:53,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1322528718, now seen corresponding path program 20 times [2018-11-07 22:11:53,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:11:53,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:53,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:11:53,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:53,363 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:11:53,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:11:53,737 INFO L134 CoverageAnalysis]: Checked inductivity of 566 backedges. 151 proven. 262 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-11-07 22:11:53,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:53,737 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:11:53,737 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:11:53,737 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:11:53,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:53,738 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 22:11:53,746 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:11:53,747 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:11:53,791 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-11-07 22:11:53,791 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:11:53,794 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:11:54,510 INFO L134 CoverageAnalysis]: Checked inductivity of 566 backedges. 46 proven. 367 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-11-07 22:11:54,511 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:11:55,319 INFO L134 CoverageAnalysis]: Checked inductivity of 566 backedges. 46 proven. 367 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-11-07 22:11:55,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:11:55,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 29, 29] total 56 [2018-11-07 22:11:55,339 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:11:55,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-07 22:11:55,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-07 22:11:55,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=479, Invalid=2601, Unknown=0, NotChecked=0, Total=3080 [2018-11-07 22:11:55,340 INFO L87 Difference]: Start difference. First operand 122 states and 123 transitions. Second operand 42 states. [2018-11-07 22:11:56,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:11:56,472 INFO L93 Difference]: Finished difference Result 137 states and 139 transitions. [2018-11-07 22:11:56,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-07 22:11:56,473 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 119 [2018-11-07 22:11:56,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:11:56,474 INFO L225 Difference]: With dead ends: 137 [2018-11-07 22:11:56,475 INFO L226 Difference]: Without dead ends: 135 [2018-11-07 22:11:56,476 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 199 SyntacticMatches, 14 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2051 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1126, Invalid=5194, Unknown=0, NotChecked=0, Total=6320 [2018-11-07 22:11:56,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-11-07 22:11:56,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 130. [2018-11-07 22:11:56,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-11-07 22:11:56,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 131 transitions. [2018-11-07 22:11:56,484 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 131 transitions. Word has length 119 [2018-11-07 22:11:56,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:11:56,485 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 131 transitions. [2018-11-07 22:11:56,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-07 22:11:56,485 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 131 transitions. [2018-11-07 22:11:56,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-07 22:11:56,486 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:11:56,486 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:11:56,486 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:11:56,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:11:56,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1290002927, now seen corresponding path program 21 times [2018-11-07 22:11:56,487 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:11:56,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:56,487 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:11:56,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:56,488 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:11:56,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:11:57,413 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 241 proven. 220 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-11-07 22:11:57,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:57,413 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:11:57,413 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:11:57,413 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:11:57,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:57,414 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 22:11:57,421 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:11:57,422 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:11:57,456 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:11:57,456 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:11:57,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:11:58,484 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 51 proven. 410 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-11-07 22:11:58,484 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:01,030 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 51 proven. 410 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-11-07 22:12:01,051 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:01,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 85 [2018-11-07 22:12:01,051 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:01,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-11-07 22:12:01,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-11-07 22:12:01,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=897, Invalid=6243, Unknown=0, NotChecked=0, Total=7140 [2018-11-07 22:12:01,053 INFO L87 Difference]: Start difference. First operand 130 states and 131 transitions. Second operand 58 states. [2018-11-07 22:12:03,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:03,195 INFO L93 Difference]: Finished difference Result 241 states and 246 transitions. [2018-11-07 22:12:03,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-07 22:12:03,195 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 127 [2018-11-07 22:12:03,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:03,197 INFO L225 Difference]: With dead ends: 241 [2018-11-07 22:12:03,197 INFO L226 Difference]: Without dead ends: 142 [2018-11-07 22:12:03,199 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 198 SyntacticMatches, 6 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2904 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1276, Invalid=8824, Unknown=0, NotChecked=0, Total=10100 [2018-11-07 22:12:03,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-11-07 22:12:03,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 132. [2018-11-07 22:12:03,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-11-07 22:12:03,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 133 transitions. [2018-11-07 22:12:03,208 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 133 transitions. Word has length 127 [2018-11-07 22:12:03,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:03,208 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 133 transitions. [2018-11-07 22:12:03,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-11-07 22:12:03,209 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 133 transitions. [2018-11-07 22:12:03,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-07 22:12:03,209 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:03,210 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 12, 12, 12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:03,210 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:03,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:03,210 INFO L82 PathProgramCache]: Analyzing trace with hash -348663797, now seen corresponding path program 22 times [2018-11-07 22:12:03,210 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:03,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:03,211 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:12:03,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:03,211 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:03,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:03,667 INFO L134 CoverageAnalysis]: Checked inductivity of 677 backedges. 177 proven. 310 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-11-07 22:12:03,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:03,667 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:03,667 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:12:03,667 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:12:03,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:03,668 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 22:12:03,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:03,686 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:12:03,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:03,721 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:12:04,134 INFO L134 CoverageAnalysis]: Checked inductivity of 677 backedges. 22 proven. 435 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 22:12:04,134 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:04,693 INFO L134 CoverageAnalysis]: Checked inductivity of 677 backedges. 22 proven. 435 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 22:12:04,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:04,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29, 29] total 58 [2018-11-07 22:12:04,713 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:04,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-11-07 22:12:04,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-07 22:12:04,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=532, Invalid=2774, Unknown=0, NotChecked=0, Total=3306 [2018-11-07 22:12:04,715 INFO L87 Difference]: Start difference. First operand 132 states and 133 transitions. Second operand 45 states. [2018-11-07 22:12:06,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:06,448 INFO L93 Difference]: Finished difference Result 147 states and 149 transitions. [2018-11-07 22:12:06,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-07 22:12:06,449 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 129 [2018-11-07 22:12:06,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:06,450 INFO L225 Difference]: With dead ends: 147 [2018-11-07 22:12:06,451 INFO L226 Difference]: Without dead ends: 145 [2018-11-07 22:12:06,451 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 220 SyntacticMatches, 13 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2218 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1262, Invalid=5710, Unknown=0, NotChecked=0, Total=6972 [2018-11-07 22:12:06,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-11-07 22:12:06,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 140. [2018-11-07 22:12:06,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-11-07 22:12:06,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 141 transitions. [2018-11-07 22:12:06,460 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 141 transitions. Word has length 129 [2018-11-07 22:12:06,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:06,461 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 141 transitions. [2018-11-07 22:12:06,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-11-07 22:12:06,461 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 141 transitions. [2018-11-07 22:12:06,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-11-07 22:12:06,462 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:06,462 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:06,462 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:06,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:06,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1445867854, now seen corresponding path program 23 times [2018-11-07 22:12:06,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:06,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:06,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:06,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:06,463 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:06,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:07,507 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 287 proven. 252 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2018-11-07 22:12:07,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:07,508 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:07,508 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:12:07,508 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:12:07,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:07,508 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 22:12:07,517 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:12:07,517 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:12:07,569 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-11-07 22:12:07,569 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:12:07,573 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:12:08,389 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 56 proven. 483 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2018-11-07 22:12:08,390 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:09,948 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 56 proven. 483 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2018-11-07 22:12:09,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:09,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 35, 34] total 79 [2018-11-07 22:12:09,973 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:09,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-11-07 22:12:09,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-11-07 22:12:09,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=824, Invalid=5338, Unknown=0, NotChecked=0, Total=6162 [2018-11-07 22:12:09,975 INFO L87 Difference]: Start difference. First operand 140 states and 141 transitions. Second operand 50 states. [2018-11-07 22:12:11,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:11,221 INFO L93 Difference]: Finished difference Result 205 states and 220 transitions. [2018-11-07 22:12:11,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-11-07 22:12:11,222 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 137 [2018-11-07 22:12:11,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:11,224 INFO L225 Difference]: With dead ends: 205 [2018-11-07 22:12:11,224 INFO L226 Difference]: Without dead ends: 142 [2018-11-07 22:12:11,225 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 227 SyntacticMatches, 5 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2979 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1136, Invalid=7794, Unknown=0, NotChecked=0, Total=8930 [2018-11-07 22:12:11,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-11-07 22:12:11,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2018-11-07 22:12:11,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-11-07 22:12:11,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 143 transitions. [2018-11-07 22:12:11,236 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 143 transitions. Word has length 137 [2018-11-07 22:12:11,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:11,236 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 143 transitions. [2018-11-07 22:12:11,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-11-07 22:12:11,237 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 143 transitions. [2018-11-07 22:12:11,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-07 22:12:11,237 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:11,238 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 13, 13, 13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:11,238 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:11,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:11,238 INFO L82 PathProgramCache]: Analyzing trace with hash -277400888, now seen corresponding path program 24 times [2018-11-07 22:12:11,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:11,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:11,239 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:12:11,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:11,239 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:11,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:11,753 INFO L134 CoverageAnalysis]: Checked inductivity of 798 backedges. 205 proven. 362 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2018-11-07 22:12:11,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:11,753 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:11,753 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:12:11,754 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:12:11,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:11,754 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 22:12:11,762 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:12:11,762 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:12:11,801 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:12:11,801 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:12:11,805 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:12:12,352 INFO L134 CoverageAnalysis]: Checked inductivity of 798 backedges. 23 proven. 544 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2018-11-07 22:12:12,353 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:13,032 INFO L134 CoverageAnalysis]: Checked inductivity of 798 backedges. 23 proven. 544 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2018-11-07 22:12:13,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:13,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 33, 33] total 64 [2018-11-07 22:12:13,054 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:13,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-07 22:12:13,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-07 22:12:13,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=615, Invalid=3417, Unknown=0, NotChecked=0, Total=4032 [2018-11-07 22:12:13,056 INFO L87 Difference]: Start difference. First operand 142 states and 143 transitions. Second operand 48 states. [2018-11-07 22:12:14,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:14,873 INFO L93 Difference]: Finished difference Result 157 states and 159 transitions. [2018-11-07 22:12:14,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-07 22:12:14,874 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 139 [2018-11-07 22:12:14,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:14,876 INFO L225 Difference]: With dead ends: 157 [2018-11-07 22:12:14,876 INFO L226 Difference]: Without dead ends: 155 [2018-11-07 22:12:14,877 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 233 SyntacticMatches, 16 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2760 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1460, Invalid=6912, Unknown=0, NotChecked=0, Total=8372 [2018-11-07 22:12:14,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-11-07 22:12:14,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 150. [2018-11-07 22:12:14,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-11-07 22:12:14,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 151 transitions. [2018-11-07 22:12:14,886 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 151 transitions. Word has length 139 [2018-11-07 22:12:14,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:14,887 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 151 transitions. [2018-11-07 22:12:14,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-07 22:12:14,887 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 151 transitions. [2018-11-07 22:12:14,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-07 22:12:14,888 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:14,888 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:14,888 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:14,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:14,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1416726283, now seen corresponding path program 25 times [2018-11-07 22:12:14,889 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:14,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:14,890 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:12:14,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:14,890 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:14,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:16,289 INFO L134 CoverageAnalysis]: Checked inductivity of 899 backedges. 337 proven. 286 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-11-07 22:12:16,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:16,290 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:16,290 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:12:16,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 22:12:16,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:16,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 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 22:12:16,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:16,300 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:12:16,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:16,345 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:12:17,739 INFO L134 CoverageAnalysis]: Checked inductivity of 899 backedges. 25 proven. 598 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-11-07 22:12:17,739 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:19,964 INFO L134 CoverageAnalysis]: Checked inductivity of 899 backedges. 25 proven. 598 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-11-07 22:12:19,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:19,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 97 [2018-11-07 22:12:19,984 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:19,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-11-07 22:12:19,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-11-07 22:12:19,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1178, Invalid=8134, Unknown=0, NotChecked=0, Total=9312 [2018-11-07 22:12:19,985 INFO L87 Difference]: Start difference. First operand 150 states and 151 transitions. Second operand 66 states. [2018-11-07 22:12:23,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:23,150 INFO L93 Difference]: Finished difference Result 277 states and 282 transitions. [2018-11-07 22:12:23,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-07 22:12:23,151 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 147 [2018-11-07 22:12:23,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:23,153 INFO L225 Difference]: With dead ends: 277 [2018-11-07 22:12:23,153 INFO L226 Difference]: Without dead ends: 162 [2018-11-07 22:12:23,156 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 230 SyntacticMatches, 6 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3824 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=1658, Invalid=11452, Unknown=0, NotChecked=0, Total=13110 [2018-11-07 22:12:23,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-11-07 22:12:23,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 152. [2018-11-07 22:12:23,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-11-07 22:12:23,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 153 transitions. [2018-11-07 22:12:23,166 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 153 transitions. Word has length 147 [2018-11-07 22:12:23,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:23,166 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 153 transitions. [2018-11-07 22:12:23,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-11-07 22:12:23,167 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 153 transitions. [2018-11-07 22:12:23,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-11-07 22:12:23,168 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:23,168 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 14, 14, 14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:23,168 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:23,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:23,168 INFO L82 PathProgramCache]: Analyzing trace with hash -2144700411, now seen corresponding path program 26 times [2018-11-07 22:12:23,168 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:23,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:23,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:23,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:23,169 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:23,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:24,638 INFO L134 CoverageAnalysis]: Checked inductivity of 929 backedges. 235 proven. 418 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-11-07 22:12:24,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:24,639 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:24,639 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:12:24,639 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:12:24,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:24,639 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 22:12:24,649 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:12:24,649 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:12:24,706 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-11-07 22:12:24,706 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:12:24,710 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:12:25,256 INFO L134 CoverageAnalysis]: Checked inductivity of 929 backedges. 61 proven. 592 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-11-07 22:12:25,256 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:26,444 INFO L134 CoverageAnalysis]: Checked inductivity of 929 backedges. 61 proven. 592 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-11-07 22:12:26,464 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:26,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 35, 35] total 68 [2018-11-07 22:12:26,464 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:26,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-11-07 22:12:26,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-11-07 22:12:26,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=707, Invalid=3849, Unknown=0, NotChecked=0, Total=4556 [2018-11-07 22:12:26,465 INFO L87 Difference]: Start difference. First operand 152 states and 153 transitions. Second operand 51 states. [2018-11-07 22:12:27,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:27,880 INFO L93 Difference]: Finished difference Result 167 states and 169 transitions. [2018-11-07 22:12:27,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-07 22:12:27,881 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 149 [2018-11-07 22:12:27,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:27,883 INFO L225 Difference]: With dead ends: 167 [2018-11-07 22:12:27,883 INFO L226 Difference]: Without dead ends: 165 [2018-11-07 22:12:27,884 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 250 SyntacticMatches, 17 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3152 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1696, Invalid=7810, Unknown=0, NotChecked=0, Total=9506 [2018-11-07 22:12:27,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-11-07 22:12:27,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 160. [2018-11-07 22:12:27,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-11-07 22:12:27,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 161 transitions. [2018-11-07 22:12:27,895 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 161 transitions. Word has length 149 [2018-11-07 22:12:27,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:27,896 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 161 transitions. [2018-11-07 22:12:27,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-11-07 22:12:27,896 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 161 transitions. [2018-11-07 22:12:27,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-11-07 22:12:27,897 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:27,897 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:27,897 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:27,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:27,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1214136136, now seen corresponding path program 27 times [2018-11-07 22:12:27,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:27,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:27,899 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:12:27,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:27,899 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:27,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:29,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1038 backedges. 391 proven. 322 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2018-11-07 22:12:29,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:29,448 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:29,448 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:12:29,448 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:12:29,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:29,448 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 22:12:29,458 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:12:29,458 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:12:29,505 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:12:29,506 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:12:29,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:12:31,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1038 backedges. 66 proven. 647 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2018-11-07 22:12:31,388 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:33,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1038 backedges. 66 proven. 647 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2018-11-07 22:12:33,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:33,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 103 [2018-11-07 22:12:33,911 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:33,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-11-07 22:12:33,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-11-07 22:12:33,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1314, Invalid=9192, Unknown=0, NotChecked=0, Total=10506 [2018-11-07 22:12:33,912 INFO L87 Difference]: Start difference. First operand 160 states and 161 transitions. Second operand 70 states. [2018-11-07 22:12:37,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:37,910 INFO L93 Difference]: Finished difference Result 295 states and 300 transitions. [2018-11-07 22:12:37,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-07 22:12:37,910 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 157 [2018-11-07 22:12:37,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:37,913 INFO L225 Difference]: With dead ends: 295 [2018-11-07 22:12:37,913 INFO L226 Difference]: Without dead ends: 172 [2018-11-07 22:12:37,915 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 246 SyntacticMatches, 6 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4299 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=1849, Invalid=12913, Unknown=0, NotChecked=0, Total=14762 [2018-11-07 22:12:37,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-11-07 22:12:37,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 162. [2018-11-07 22:12:37,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-11-07 22:12:37,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 163 transitions. [2018-11-07 22:12:37,924 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 163 transitions. Word has length 157 [2018-11-07 22:12:37,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:37,924 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 163 transitions. [2018-11-07 22:12:37,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-11-07 22:12:37,925 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 163 transitions. [2018-11-07 22:12:37,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-11-07 22:12:37,925 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:37,925 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 15, 15, 15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:37,926 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:37,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:37,926 INFO L82 PathProgramCache]: Analyzing trace with hash -50217022, now seen corresponding path program 28 times [2018-11-07 22:12:37,926 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:37,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:37,927 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:12:37,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:37,927 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:37,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:38,456 INFO L134 CoverageAnalysis]: Checked inductivity of 1070 backedges. 267 proven. 478 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2018-11-07 22:12:38,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:38,456 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:38,456 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:12:38,456 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:12:38,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:38,457 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 22:12:38,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:38,470 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:12:38,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:38,524 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:12:39,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1070 backedges. 28 proven. 678 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2018-11-07 22:12:39,180 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:40,025 INFO L134 CoverageAnalysis]: Checked inductivity of 1070 backedges. 28 proven. 678 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2018-11-07 22:12:40,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:40,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 35, 35] total 70 [2018-11-07 22:12:40,045 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:40,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-11-07 22:12:40,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-11-07 22:12:40,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=772, Invalid=4058, Unknown=0, NotChecked=0, Total=4830 [2018-11-07 22:12:40,046 INFO L87 Difference]: Start difference. First operand 162 states and 163 transitions. Second operand 54 states. [2018-11-07 22:12:41,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:41,888 INFO L93 Difference]: Finished difference Result 177 states and 179 transitions. [2018-11-07 22:12:41,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-07 22:12:41,888 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 159 [2018-11-07 22:12:41,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:41,890 INFO L225 Difference]: With dead ends: 177 [2018-11-07 22:12:41,890 INFO L226 Difference]: Without dead ends: 175 [2018-11-07 22:12:41,892 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 271 SyntacticMatches, 16 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3355 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1862, Invalid=8440, Unknown=0, NotChecked=0, Total=10302 [2018-11-07 22:12:41,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-11-07 22:12:41,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 170. [2018-11-07 22:12:41,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-11-07 22:12:41,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 171 transitions. [2018-11-07 22:12:41,903 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 171 transitions. Word has length 159 [2018-11-07 22:12:41,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:41,903 INFO L480 AbstractCegarLoop]: Abstraction has 170 states and 171 transitions. [2018-11-07 22:12:41,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-11-07 22:12:41,903 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 171 transitions. [2018-11-07 22:12:41,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-11-07 22:12:41,904 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:41,904 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:41,905 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:41,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:41,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1870952965, now seen corresponding path program 29 times [2018-11-07 22:12:41,905 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:41,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:41,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:41,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:41,906 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:41,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:43,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1187 backedges. 449 proven. 360 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2018-11-07 22:12:43,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:43,518 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:43,519 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:12:43,519 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:12:43,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:43,519 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 22:12:43,529 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:12:43,529 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:12:43,593 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-11-07 22:12:43,593 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:12:43,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:12:44,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1187 backedges. 71 proven. 738 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2018-11-07 22:12:44,989 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:47,498 INFO L134 CoverageAnalysis]: Checked inductivity of 1187 backedges. 71 proven. 738 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2018-11-07 22:12:47,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:47,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 41, 40] total 110 [2018-11-07 22:12:47,518 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:47,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-11-07 22:12:47,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-11-07 22:12:47,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1514, Invalid=10476, Unknown=0, NotChecked=0, Total=11990 [2018-11-07 22:12:47,520 INFO L87 Difference]: Start difference. First operand 170 states and 171 transitions. Second operand 75 states. [2018-11-07 22:12:50,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:50,066 INFO L93 Difference]: Finished difference Result 247 states and 265 transitions. [2018-11-07 22:12:50,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-11-07 22:12:50,067 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 167 [2018-11-07 22:12:50,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:50,069 INFO L225 Difference]: With dead ends: 247 [2018-11-07 22:12:50,069 INFO L226 Difference]: Without dead ends: 172 [2018-11-07 22:12:50,072 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 262 SyntacticMatches, 5 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6855 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=2011, Invalid=15019, Unknown=0, NotChecked=0, Total=17030 [2018-11-07 22:12:50,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-11-07 22:12:50,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2018-11-07 22:12:50,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-11-07 22:12:50,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 173 transitions. [2018-11-07 22:12:50,085 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 173 transitions. Word has length 167 [2018-11-07 22:12:50,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:50,085 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 173 transitions. [2018-11-07 22:12:50,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-11-07 22:12:50,086 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 173 transitions. [2018-11-07 22:12:50,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-11-07 22:12:50,087 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:50,087 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 16, 16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:50,087 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:50,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:50,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1120217599, now seen corresponding path program 30 times [2018-11-07 22:12:50,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:50,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:50,088 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:12:50,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:50,089 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:50,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:51,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 301 proven. 542 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2018-11-07 22:12:51,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:51,966 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:51,966 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:12:51,966 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:12:51,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:51,967 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 22:12:51,975 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:12:51,975 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:12:52,024 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:12:52,025 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:12:52,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:12:53,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 29 proven. 814 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2018-11-07 22:12:53,524 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:54,423 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 29 proven. 814 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2018-11-07 22:12:54,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:54,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 39, 39] total 76 [2018-11-07 22:12:54,443 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:54,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-11-07 22:12:54,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-11-07 22:12:54,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=870, Invalid=4830, Unknown=0, NotChecked=0, Total=5700 [2018-11-07 22:12:54,445 INFO L87 Difference]: Start difference. First operand 172 states and 173 transitions. Second operand 57 states. [2018-11-07 22:12:56,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:56,543 INFO L93 Difference]: Finished difference Result 187 states and 189 transitions. [2018-11-07 22:12:56,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-07 22:12:56,544 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 169 [2018-11-07 22:12:56,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:56,545 INFO L225 Difference]: With dead ends: 187 [2018-11-07 22:12:56,546 INFO L226 Difference]: Without dead ends: 185 [2018-11-07 22:12:56,547 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 284 SyntacticMatches, 19 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4017 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=2099, Invalid=9891, Unknown=0, NotChecked=0, Total=11990 [2018-11-07 22:12:56,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-11-07 22:12:56,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 180. [2018-11-07 22:12:56,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-11-07 22:12:56,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 181 transitions. [2018-11-07 22:12:56,558 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 181 transitions. Word has length 169 [2018-11-07 22:12:56,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:56,559 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 181 transitions. [2018-11-07 22:12:56,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-11-07 22:12:56,559 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 181 transitions. [2018-11-07 22:12:56,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-11-07 22:12:56,560 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:56,560 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:56,560 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:56,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:56,561 INFO L82 PathProgramCache]: Analyzing trace with hash -326346942, now seen corresponding path program 31 times [2018-11-07 22:12:56,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:56,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:56,562 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:12:56,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:56,562 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:56,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:58,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1346 backedges. 511 proven. 400 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2018-11-07 22:12:58,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:58,080 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:58,080 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:12:58,080 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:12:58,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:58,080 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 22:12:58,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:58,088 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:12:58,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:58,150 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:13:00,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1346 backedges. 31 proven. 880 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2018-11-07 22:13:00,468 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:13:03,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1346 backedges. 31 proven. 880 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2018-11-07 22:13:03,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:13:03,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 115 [2018-11-07 22:13:03,814 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:13:03,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-11-07 22:13:03,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-11-07 22:13:03,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1652, Invalid=11458, Unknown=0, NotChecked=0, Total=13110 [2018-11-07 22:13:03,816 INFO L87 Difference]: Start difference. First operand 180 states and 181 transitions. Second operand 78 states. [2018-11-07 22:13:07,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:13:07,177 INFO L93 Difference]: Finished difference Result 331 states and 336 transitions. [2018-11-07 22:13:07,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-11-07 22:13:07,177 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 177 [2018-11-07 22:13:07,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:13:07,179 INFO L225 Difference]: With dead ends: 331 [2018-11-07 22:13:07,179 INFO L226 Difference]: Without dead ends: 192 [2018-11-07 22:13:07,181 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 278 SyntacticMatches, 6 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5405 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=2306, Invalid=16054, Unknown=0, NotChecked=0, Total=18360 [2018-11-07 22:13:07,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-11-07 22:13:07,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 182. [2018-11-07 22:13:07,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-11-07 22:13:07,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 183 transitions. [2018-11-07 22:13:07,194 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 183 transitions. Word has length 177 [2018-11-07 22:13:07,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:13:07,195 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 183 transitions. [2018-11-07 22:13:07,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-11-07 22:13:07,195 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 183 transitions. [2018-11-07 22:13:07,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-11-07 22:13:07,196 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:13:07,196 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 17, 17, 17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:13:07,196 INFO L423 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:13:07,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:07,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1834276540, now seen corresponding path program 32 times [2018-11-07 22:13:07,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:13:07,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:07,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:13:07,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:07,198 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:13:07,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:07,750 INFO L134 CoverageAnalysis]: Checked inductivity of 1382 backedges. 337 proven. 610 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2018-11-07 22:13:07,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:07,751 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:13:07,751 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:13:07,751 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:13:07,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:07,751 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 22:13:07,759 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:13:07,759 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:13:07,829 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2018-11-07 22:13:07,829 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:13:07,833 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:13:08,562 INFO L134 CoverageAnalysis]: Checked inductivity of 1382 backedges. 76 proven. 871 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2018-11-07 22:13:08,562 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:13:09,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1382 backedges. 76 proven. 871 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2018-11-07 22:13:09,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:13:09,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 41, 41] total 80 [2018-11-07 22:13:09,621 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:13:09,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-11-07 22:13:09,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-11-07 22:13:09,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=980, Invalid=5340, Unknown=0, NotChecked=0, Total=6320 [2018-11-07 22:13:09,622 INFO L87 Difference]: Start difference. First operand 182 states and 183 transitions. Second operand 60 states. [2018-11-07 22:13:11,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:13:11,427 INFO L93 Difference]: Finished difference Result 197 states and 199 transitions. [2018-11-07 22:13:11,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-07 22:13:11,428 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 179 [2018-11-07 22:13:11,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:13:11,429 INFO L225 Difference]: With dead ends: 197 [2018-11-07 22:13:11,429 INFO L226 Difference]: Without dead ends: 195 [2018-11-07 22:13:11,430 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 301 SyntacticMatches, 20 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4487 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2383, Invalid=10957, Unknown=0, NotChecked=0, Total=13340 [2018-11-07 22:13:11,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-11-07 22:13:11,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 190. [2018-11-07 22:13:11,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-11-07 22:13:11,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 191 transitions. [2018-11-07 22:13:11,442 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 191 transitions. Word has length 179 [2018-11-07 22:13:11,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:13:11,443 INFO L480 AbstractCegarLoop]: Abstraction has 190 states and 191 transitions. [2018-11-07 22:13:11,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-11-07 22:13:11,443 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 191 transitions. [2018-11-07 22:13:11,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-11-07 22:13:11,444 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:13:11,444 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:13:11,445 INFO L423 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:13:11,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:11,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1992952065, now seen corresponding path program 33 times [2018-11-07 22:13:11,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:13:11,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:11,446 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:13:11,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:11,446 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:13:11,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:13,186 INFO L134 CoverageAnalysis]: Checked inductivity of 1515 backedges. 577 proven. 442 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2018-11-07 22:13:13,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:13,186 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:13:13,187 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:13:13,187 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:13:13,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:13,187 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 22:13:13,194 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:13:13,195 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:13:13,247 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:13:13,247 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:13:13,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:13:15,328 INFO L134 CoverageAnalysis]: Checked inductivity of 1515 backedges. 81 proven. 938 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2018-11-07 22:13:15,328 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:13:19,025 INFO L134 CoverageAnalysis]: Checked inductivity of 1515 backedges. 81 proven. 938 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2018-11-07 22:13:19,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:13:19,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 121 [2018-11-07 22:13:19,045 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:13:19,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-11-07 22:13:19,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-11-07 22:13:19,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1812, Invalid=12708, Unknown=0, NotChecked=0, Total=14520 [2018-11-07 22:13:19,047 INFO L87 Difference]: Start difference. First operand 190 states and 191 transitions. Second operand 82 states. [2018-11-07 22:13:23,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:13:23,039 INFO L93 Difference]: Finished difference Result 349 states and 354 transitions. [2018-11-07 22:13:23,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-07 22:13:23,040 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 187 [2018-11-07 22:13:23,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:13:23,041 INFO L225 Difference]: With dead ends: 349 [2018-11-07 22:13:23,041 INFO L226 Difference]: Without dead ends: 202 [2018-11-07 22:13:23,043 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 294 SyntacticMatches, 6 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5964 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=2530, Invalid=17776, Unknown=0, NotChecked=0, Total=20306 [2018-11-07 22:13:23,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-11-07 22:13:23,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 192. [2018-11-07 22:13:23,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-11-07 22:13:23,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 193 transitions. [2018-11-07 22:13:23,053 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 193 transitions. Word has length 187 [2018-11-07 22:13:23,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:13:23,054 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 193 transitions. [2018-11-07 22:13:23,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-11-07 22:13:23,054 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 193 transitions. [2018-11-07 22:13:23,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-11-07 22:13:23,055 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:13:23,055 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 18, 18, 18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:13:23,055 INFO L423 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:13:23,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:23,056 INFO L82 PathProgramCache]: Analyzing trace with hash 430499321, now seen corresponding path program 34 times [2018-11-07 22:13:23,056 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:13:23,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:23,057 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:13:23,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:23,057 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:13:23,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:23,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1553 backedges. 375 proven. 682 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2018-11-07 22:13:23,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:23,793 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:13:23,793 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:13:23,793 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:13:23,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:23,793 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 22:13:23,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:13:23,802 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:13:23,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:23,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:13:24,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1553 backedges. 34 proven. 975 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-11-07 22:13:24,857 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:13:25,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1553 backedges. 34 proven. 975 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-11-07 22:13:25,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:13:25,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 41, 41] total 82 [2018-11-07 22:13:25,862 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:13:25,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-11-07 22:13:25,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-11-07 22:13:25,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1057, Invalid=5585, Unknown=0, NotChecked=0, Total=6642 [2018-11-07 22:13:25,863 INFO L87 Difference]: Start difference. First operand 192 states and 193 transitions. Second operand 63 states. [2018-11-07 22:13:28,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:13:28,237 INFO L93 Difference]: Finished difference Result 207 states and 209 transitions. [2018-11-07 22:13:28,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-07 22:13:28,238 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 189 [2018-11-07 22:13:28,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:13:28,239 INFO L225 Difference]: With dead ends: 207 [2018-11-07 22:13:28,239 INFO L226 Difference]: Without dead ends: 205 [2018-11-07 22:13:28,241 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 322 SyntacticMatches, 19 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4726 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=2579, Invalid=11701, Unknown=0, NotChecked=0, Total=14280 [2018-11-07 22:13:28,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-11-07 22:13:28,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 200. [2018-11-07 22:13:28,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-11-07 22:13:28,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 201 transitions. [2018-11-07 22:13:28,254 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 201 transitions. Word has length 189 [2018-11-07 22:13:28,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:13:28,254 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 201 transitions. [2018-11-07 22:13:28,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-11-07 22:13:28,254 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 201 transitions. [2018-11-07 22:13:28,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-11-07 22:13:28,255 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:13:28,256 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:13:28,256 INFO L423 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:13:28,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:28,256 INFO L82 PathProgramCache]: Analyzing trace with hash -128353988, now seen corresponding path program 35 times [2018-11-07 22:13:28,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:13:28,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:28,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:13:28,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:28,257 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:13:28,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:29,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1694 backedges. 647 proven. 486 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2018-11-07 22:13:29,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:29,983 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:13:29,983 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:13:29,983 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:13:29,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:29,984 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 22:13:29,992 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:13:29,992 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:13:30,068 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-11-07 22:13:30,068 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:13:30,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:13:31,899 INFO L134 CoverageAnalysis]: Checked inductivity of 1694 backedges. 86 proven. 1047 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2018-11-07 22:13:31,899 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:13:35,267 INFO L134 CoverageAnalysis]: Checked inductivity of 1694 backedges. 86 proven. 1047 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2018-11-07 22:13:35,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:13:35,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 47, 46] total 128 [2018-11-07 22:13:35,287 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:13:35,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-11-07 22:13:35,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-11-07 22:13:35,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2072, Invalid=14184, Unknown=0, NotChecked=0, Total=16256 [2018-11-07 22:13:35,289 INFO L87 Difference]: Start difference. First operand 200 states and 201 transitions. Second operand 87 states. [2018-11-07 22:13:38,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:13:38,608 INFO L93 Difference]: Finished difference Result 289 states and 310 transitions. [2018-11-07 22:13:38,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-11-07 22:13:38,609 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 197 [2018-11-07 22:13:38,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:13:38,610 INFO L225 Difference]: With dead ends: 289 [2018-11-07 22:13:38,611 INFO L226 Difference]: Without dead ends: 202 [2018-11-07 22:13:38,613 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 310 SyntacticMatches, 5 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9456 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=2713, Invalid=20239, Unknown=0, NotChecked=0, Total=22952 [2018-11-07 22:13:38,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-11-07 22:13:38,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2018-11-07 22:13:38,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-11-07 22:13:38,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 203 transitions. [2018-11-07 22:13:38,625 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 203 transitions. Word has length 197 [2018-11-07 22:13:38,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:13:38,625 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 203 transitions. [2018-11-07 22:13:38,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-11-07 22:13:38,625 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 203 transitions. [2018-11-07 22:13:38,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-11-07 22:13:38,626 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:13:38,626 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 19, 19, 19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:13:38,626 INFO L423 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:13:38,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:38,627 INFO L82 PathProgramCache]: Analyzing trace with hash 668039094, now seen corresponding path program 36 times [2018-11-07 22:13:38,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:13:38,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:38,627 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:13:38,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:38,628 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:13:38,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:40,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1734 backedges. 415 proven. 758 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2018-11-07 22:13:40,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:40,575 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:13:40,575 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:13:40,575 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:13:40,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:40,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 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 22:13:40,584 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:13:40,584 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:13:40,645 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:13:40,645 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:13:40,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:13:42,590 INFO L134 CoverageAnalysis]: Checked inductivity of 1734 backedges. 35 proven. 1138 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2018-11-07 22:13:42,590 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:13:43,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1734 backedges. 35 proven. 1138 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2018-11-07 22:13:43,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:13:43,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 45, 45] total 88 [2018-11-07 22:13:43,795 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:13:43,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-11-07 22:13:43,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-11-07 22:13:43,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1170, Invalid=6486, Unknown=0, NotChecked=0, Total=7656 [2018-11-07 22:13:43,797 INFO L87 Difference]: Start difference. First operand 202 states and 203 transitions. Second operand 66 states. [2018-11-07 22:13:46,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:13:46,122 INFO L93 Difference]: Finished difference Result 217 states and 219 transitions. [2018-11-07 22:13:46,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-07 22:13:46,122 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 199 [2018-11-07 22:13:46,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:13:46,124 INFO L225 Difference]: With dead ends: 217 [2018-11-07 22:13:46,124 INFO L226 Difference]: Without dead ends: 215 [2018-11-07 22:13:46,126 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 335 SyntacticMatches, 22 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5508 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=2855, Invalid=13401, Unknown=0, NotChecked=0, Total=16256 [2018-11-07 22:13:46,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-11-07 22:13:46,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 210. [2018-11-07 22:13:46,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-11-07 22:13:46,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 211 transitions. [2018-11-07 22:13:46,139 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 211 transitions. Word has length 199 [2018-11-07 22:13:46,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:13:46,140 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 211 transitions. [2018-11-07 22:13:46,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-11-07 22:13:46,140 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 211 transitions. [2018-11-07 22:13:46,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-11-07 22:13:46,141 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:13:46,141 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:13:46,141 INFO L423 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:13:46,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:46,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1746469383, now seen corresponding path program 37 times [2018-11-07 22:13:46,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:13:46,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:46,143 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:13:46,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:46,143 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:13:46,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:48,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1883 backedges. 721 proven. 532 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2018-11-07 22:13:48,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:48,488 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:13:48,489 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:13:48,489 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:13:48,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:48,489 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 22:13:48,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:13:48,498 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:13:48,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:48,562 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:13:51,061 INFO L134 CoverageAnalysis]: Checked inductivity of 1883 backedges. 37 proven. 1216 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2018-11-07 22:13:51,061 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:13:55,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1883 backedges. 37 proven. 1216 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2018-11-07 22:13:55,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:13:55,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 133 [2018-11-07 22:13:55,283 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:13:55,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-11-07 22:13:55,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-11-07 22:13:55,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2207, Invalid=15349, Unknown=0, NotChecked=0, Total=17556 [2018-11-07 22:13:55,284 INFO L87 Difference]: Start difference. First operand 210 states and 211 transitions. Second operand 90 states. [2018-11-07 22:14:00,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:14:00,254 INFO L93 Difference]: Finished difference Result 385 states and 390 transitions. [2018-11-07 22:14:00,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-11-07 22:14:00,255 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 207 [2018-11-07 22:14:00,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:14:00,256 INFO L225 Difference]: With dead ends: 385 [2018-11-07 22:14:00,256 INFO L226 Difference]: Without dead ends: 222 [2018-11-07 22:14:00,258 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 487 GetRequests, 326 SyntacticMatches, 6 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7256 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=3062, Invalid=21430, Unknown=0, NotChecked=0, Total=24492 [2018-11-07 22:14:00,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-11-07 22:14:00,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 212. [2018-11-07 22:14:00,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-11-07 22:14:00,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 213 transitions. [2018-11-07 22:14:00,271 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 213 transitions. Word has length 207 [2018-11-07 22:14:00,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:14:00,272 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 213 transitions. [2018-11-07 22:14:00,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-11-07 22:14:00,272 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 213 transitions. [2018-11-07 22:14:00,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-11-07 22:14:00,273 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:14:00,273 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 20, 20, 20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:14:00,273 INFO L423 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:14:00,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:14:00,274 INFO L82 PathProgramCache]: Analyzing trace with hash -50942989, now seen corresponding path program 38 times [2018-11-07 22:14:00,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:14:00,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:00,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:14:00,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:00,275 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:14:00,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:01,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1925 backedges. 457 proven. 838 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2018-11-07 22:14:01,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:01,282 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:14:01,283 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:14:01,283 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:14:01,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:01,283 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 22:14:01,295 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:14:01,295 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:14:01,593 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-11-07 22:14:01,593 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:14:01,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:14:02,947 INFO L134 CoverageAnalysis]: Checked inductivity of 1925 backedges. 91 proven. 1204 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2018-11-07 22:14:02,947 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:14:04,321 INFO L134 CoverageAnalysis]: Checked inductivity of 1925 backedges. 91 proven. 1204 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2018-11-07 22:14:04,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:14:04,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 47, 47] total 92 [2018-11-07 22:14:04,342 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:14:04,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-11-07 22:14:04,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-11-07 22:14:04,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1298, Invalid=7074, Unknown=0, NotChecked=0, Total=8372 [2018-11-07 22:14:04,343 INFO L87 Difference]: Start difference. First operand 212 states and 213 transitions. Second operand 69 states. [2018-11-07 22:14:06,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:14:06,772 INFO L93 Difference]: Finished difference Result 227 states and 229 transitions. [2018-11-07 22:14:06,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-11-07 22:14:06,772 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 209 [2018-11-07 22:14:06,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:14:06,774 INFO L225 Difference]: With dead ends: 227 [2018-11-07 22:14:06,774 INFO L226 Difference]: Without dead ends: 225 [2018-11-07 22:14:06,776 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 352 SyntacticMatches, 23 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6056 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=3187, Invalid=14635, Unknown=0, NotChecked=0, Total=17822 [2018-11-07 22:14:06,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-11-07 22:14:06,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 220. [2018-11-07 22:14:06,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-11-07 22:14:06,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 221 transitions. [2018-11-07 22:14:06,791 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 221 transitions. Word has length 209 [2018-11-07 22:14:06,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:14:06,791 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 221 transitions. [2018-11-07 22:14:06,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-11-07 22:14:06,791 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 221 transitions. [2018-11-07 22:14:06,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-11-07 22:14:06,793 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:14:06,793 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 21, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:14:06,793 INFO L423 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:14:06,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:14:06,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1293507274, now seen corresponding path program 39 times [2018-11-07 22:14:06,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:14:06,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:06,794 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:14:06,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:06,795 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:14:06,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:08,978 INFO L134 CoverageAnalysis]: Checked inductivity of 2082 backedges. 799 proven. 580 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2018-11-07 22:14:08,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:08,979 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:14:08,979 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:14:08,979 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:14:08,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:08,979 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 22:14:08,987 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:14:08,987 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:14:09,045 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:14:09,045 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:14:09,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:14:12,252 INFO L134 CoverageAnalysis]: Checked inductivity of 2082 backedges. 96 proven. 1283 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2018-11-07 22:14:12,252 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:14:17,014 INFO L134 CoverageAnalysis]: Checked inductivity of 2082 backedges. 96 proven. 1283 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2018-11-07 22:14:17,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:14:17,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 139 [2018-11-07 22:14:17,034 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:14:17,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-11-07 22:14:17,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-11-07 22:14:17,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2391, Invalid=16791, Unknown=0, NotChecked=0, Total=19182 [2018-11-07 22:14:17,036 INFO L87 Difference]: Start difference. First operand 220 states and 221 transitions. Second operand 94 states. [2018-11-07 22:14:22,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:14:22,146 INFO L93 Difference]: Finished difference Result 403 states and 408 transitions. [2018-11-07 22:14:22,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-11-07 22:14:22,146 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 217 [2018-11-07 22:14:22,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:14:22,148 INFO L225 Difference]: With dead ends: 403 [2018-11-07 22:14:22,148 INFO L226 Difference]: Without dead ends: 232 [2018-11-07 22:14:22,151 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 342 SyntacticMatches, 6 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7899 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=3319, Invalid=23413, Unknown=0, NotChecked=0, Total=26732 [2018-11-07 22:14:22,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-11-07 22:14:22,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 222. [2018-11-07 22:14:22,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-11-07 22:14:22,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 223 transitions. [2018-11-07 22:14:22,166 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 223 transitions. Word has length 217 [2018-11-07 22:14:22,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:14:22,166 INFO L480 AbstractCegarLoop]: Abstraction has 222 states and 223 transitions. [2018-11-07 22:14:22,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-11-07 22:14:22,167 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 223 transitions. [2018-11-07 22:14:22,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-11-07 22:14:22,168 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:14:22,168 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 21, 21, 21, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:14:22,168 INFO L423 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:14:22,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:14:22,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1163436720, now seen corresponding path program 40 times [2018-11-07 22:14:22,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:14:22,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:22,169 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:14:22,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:22,170 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:14:22,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:24,390 INFO L134 CoverageAnalysis]: Checked inductivity of 2126 backedges. 501 proven. 922 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2018-11-07 22:14:24,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:24,391 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:14:24,391 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:14:24,391 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:14:24,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:24,391 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 22:14:24,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:14:24,400 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:14:24,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:24,466 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:14:25,633 INFO L134 CoverageAnalysis]: Checked inductivity of 2126 backedges. 40 proven. 1326 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2018-11-07 22:14:25,634 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:14:26,962 INFO L134 CoverageAnalysis]: Checked inductivity of 2126 backedges. 40 proven. 1326 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2018-11-07 22:14:26,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:14:26,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 47, 47] total 94 [2018-11-07 22:14:26,982 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:14:26,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-11-07 22:14:26,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-11-07 22:14:26,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1387, Invalid=7355, Unknown=0, NotChecked=0, Total=8742 [2018-11-07 22:14:26,984 INFO L87 Difference]: Start difference. First operand 222 states and 223 transitions. Second operand 72 states. [2018-11-07 22:14:30,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:14:30,085 INFO L93 Difference]: Finished difference Result 237 states and 239 transitions. [2018-11-07 22:14:30,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-11-07 22:14:30,086 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 219 [2018-11-07 22:14:30,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:14:30,088 INFO L225 Difference]: With dead ends: 237 [2018-11-07 22:14:30,088 INFO L226 Difference]: Without dead ends: 235 [2018-11-07 22:14:30,090 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 531 GetRequests, 373 SyntacticMatches, 22 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6331 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=3413, Invalid=15493, Unknown=0, NotChecked=0, Total=18906 [2018-11-07 22:14:30,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-11-07 22:14:30,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 230. [2018-11-07 22:14:30,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-11-07 22:14:30,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 231 transitions. [2018-11-07 22:14:30,106 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 231 transitions. Word has length 219 [2018-11-07 22:14:30,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:14:30,106 INFO L480 AbstractCegarLoop]: Abstraction has 230 states and 231 transitions. [2018-11-07 22:14:30,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-11-07 22:14:30,106 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 231 transitions. [2018-11-07 22:14:30,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-11-07 22:14:30,107 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:14:30,108 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:14:30,108 INFO L423 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:14:30,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:14:30,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1131974387, now seen corresponding path program 41 times [2018-11-07 22:14:30,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:14:30,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:30,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:14:30,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:30,109 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:14:30,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:32,539 INFO L134 CoverageAnalysis]: Checked inductivity of 2291 backedges. 881 proven. 630 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2018-11-07 22:14:32,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:32,539 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:14:32,539 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:14:32,540 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:14:32,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:32,540 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 22:14:32,572 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:14:32,572 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:14:32,659 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2018-11-07 22:14:32,659 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:14:32,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:14:34,389 INFO L134 CoverageAnalysis]: Checked inductivity of 2291 backedges. 101 proven. 1410 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2018-11-07 22:14:34,389 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:14:38,020 INFO L134 CoverageAnalysis]: Checked inductivity of 2291 backedges. 101 proven. 1410 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2018-11-07 22:14:38,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:14:38,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 53, 52] total 124 [2018-11-07 22:14:38,040 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:14:38,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-11-07 22:14:38,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-11-07 22:14:38,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2057, Invalid=13195, Unknown=0, NotChecked=0, Total=15252 [2018-11-07 22:14:38,042 INFO L87 Difference]: Start difference. First operand 230 states and 231 transitions. Second operand 77 states. [2018-11-07 22:14:41,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:14:41,828 INFO L93 Difference]: Finished difference Result 331 states and 355 transitions. [2018-11-07 22:14:41,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-11-07 22:14:41,829 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 227 [2018-11-07 22:14:41,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:14:41,831 INFO L225 Difference]: With dead ends: 331 [2018-11-07 22:14:41,831 INFO L226 Difference]: Without dead ends: 232 [2018-11-07 22:14:41,833 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 532 GetRequests, 380 SyntacticMatches, 5 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7605 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=2765, Invalid=19287, Unknown=0, NotChecked=0, Total=22052 [2018-11-07 22:14:41,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-11-07 22:14:41,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2018-11-07 22:14:41,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-11-07 22:14:41,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 233 transitions. [2018-11-07 22:14:41,849 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 233 transitions. Word has length 227 [2018-11-07 22:14:41,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:14:41,850 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 233 transitions. [2018-11-07 22:14:41,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-11-07 22:14:41,850 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 233 transitions. [2018-11-07 22:14:41,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-11-07 22:14:41,851 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:14:41,851 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 22, 22, 22, 22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:14:41,852 INFO L423 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:14:41,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:14:41,852 INFO L82 PathProgramCache]: Analyzing trace with hash 911178733, now seen corresponding path program 42 times [2018-11-07 22:14:41,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:14:41,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:41,853 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:14:41,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:41,853 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:14:41,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:42,833 INFO L134 CoverageAnalysis]: Checked inductivity of 2337 backedges. 547 proven. 1010 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2018-11-07 22:14:42,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:42,833 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:14:42,834 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:14:42,834 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:14:42,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:42,834 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 22:14:42,843 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:14:42,843 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:14:42,909 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:14:42,909 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:14:42,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:14:44,263 INFO L134 CoverageAnalysis]: Checked inductivity of 2337 backedges. 41 proven. 1516 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2018-11-07 22:14:44,263 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:14:45,824 INFO L134 CoverageAnalysis]: Checked inductivity of 2337 backedges. 41 proven. 1516 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2018-11-07 22:14:45,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:14:45,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 51, 51] total 100 [2018-11-07 22:14:45,844 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:14:45,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-11-07 22:14:45,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-11-07 22:14:45,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1515, Invalid=8385, Unknown=0, NotChecked=0, Total=9900 [2018-11-07 22:14:45,846 INFO L87 Difference]: Start difference. First operand 232 states and 233 transitions. Second operand 75 states. [2018-11-07 22:14:49,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:14:49,177 INFO L93 Difference]: Finished difference Result 247 states and 249 transitions. [2018-11-07 22:14:49,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-11-07 22:14:49,177 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 229 [2018-11-07 22:14:49,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:14:49,179 INFO L225 Difference]: With dead ends: 247 [2018-11-07 22:14:49,180 INFO L226 Difference]: Without dead ends: 245 [2018-11-07 22:14:49,181 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 555 GetRequests, 386 SyntacticMatches, 25 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7233 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=3728, Invalid=17442, Unknown=0, NotChecked=0, Total=21170 [2018-11-07 22:14:49,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-11-07 22:14:49,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 240. [2018-11-07 22:14:49,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-11-07 22:14:49,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 241 transitions. [2018-11-07 22:14:49,198 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 241 transitions. Word has length 229 [2018-11-07 22:14:49,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:14:49,198 INFO L480 AbstractCegarLoop]: Abstraction has 240 states and 241 transitions. [2018-11-07 22:14:49,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-11-07 22:14:49,199 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 241 transitions. [2018-11-07 22:14:49,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-11-07 22:14:49,200 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:14:49,200 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 23, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:14:49,200 INFO L423 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:14:49,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:14:49,201 INFO L82 PathProgramCache]: Analyzing trace with hash 886364976, now seen corresponding path program 43 times [2018-11-07 22:14:49,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:14:49,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:49,201 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:14:49,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:49,202 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:14:49,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2018-11-07 22:14:52,129 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 22:14:52,134 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 22:14:52,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:14:52 BoogieIcfgContainer [2018-11-07 22:14:52,134 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 22:14:52,135 INFO L168 Benchmark]: Toolchain (without parser) took 236493.03 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 761.8 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -681.3 MB). Peak memory consumption was 80.5 MB. Max. memory is 7.1 GB. [2018-11-07 22:14:52,136 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 22:14:52,137 INFO L168 Benchmark]: CACSL2BoogieTranslator took 280.79 ms. Allocated memory is still 1.6 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 22:14:52,137 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.54 ms. Allocated memory is still 1.6 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 22:14:52,138 INFO L168 Benchmark]: Boogie Preprocessor took 23.30 ms. Allocated memory is still 1.6 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 22:14:52,138 INFO L168 Benchmark]: RCFGBuilder took 403.06 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 758.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -802.0 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. [2018-11-07 22:14:52,139 INFO L168 Benchmark]: TraceAbstraction took 235754.13 ms. Allocated memory was 2.3 GB in the beginning and 2.3 GB in the end (delta: 3.1 MB). Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 110.1 MB). Peak memory consumption was 113.3 MB. Max. memory is 7.1 GB. [2018-11-07 22:14:52,144 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.26 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 280.79 ms. Allocated memory is still 1.6 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 25.54 ms. Allocated memory is still 1.6 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.30 ms. Allocated memory is still 1.6 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 403.06 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 758.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -802.0 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 235754.13 ms. Allocated memory was 2.3 GB in the beginning and 2.3 GB in the end (delta: 3.1 MB). Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 110.1 MB). Peak memory consumption was 113.3 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 analyzing trace of length 238 with TraceHistMax 24,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateComparison was comparing new predicate (quantifier-free) to 51 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 24 locations, 1 error locations. TIMEOUT Result, 235.6s OverallTime, 47 OverallIterations, 24 TraceHistogramMax, 82.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1508 SDtfs, 6571 SDslu, 42839 SDs, 0 SdLazy, 64097 SolverSat, 6199 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 45.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 13086 GetRequests, 8817 SyntacticMatches, 425 SemanticMatches, 3844 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136504 ImplicationChecksByTransitivity, 161.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=240occurred in iteration=46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.6s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 46 MinimizatonAttempts, 240 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 143.6s InterpolantComputationTime, 10853 NumberOfCodeBlocks, 10853 NumberOfCodeBlocksAsserted, 281 NumberOfCheckSat, 16131 ConstructedInterpolants, 0 QuantifiedInterpolants, 19443847 SizeOfPredicates, 233 NumberOfNonLiveVariables, 11594 ConjunctsInSsa, 2249 ConjunctsInUnsatCore, 134 InterpolantComputations, 2 PerfectInterpolantSequences, 47728/106788 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown